On the public citation graph

Global optimization of rational functions: a semidefinite programming approach

https://doi.org/10.1007/s10107-005-0589-0
0 signed · 89 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferredcites →https://doi.org/10.1007/978-1-4757-3216-0_17openalex-snapshot
Squared Functional Systems and Optimization Problems
inferredcites →https://doi.org/10.1007/978-3-319-64546-9_12openalex-snapshot
The Moment Problem on Compact Semi-Algebraic Sets
inferredcites →https://doi.org/10.1007/bf01446568openalex-snapshot
TheK-moment problem for compact semi-algebraic sets
inferredcites →https://doi.org/10.1007/bf02572604openalex-snapshot
Uniform denominators in Hilbert's seventeenth problem
inferredcites →https://doi.org/10.1007/bf02591747openalex-snapshot
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
inferredcites →https://doi.org/10.1007/pl00011394openalex-snapshot
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
inferredcites →https://doi.org/10.1007/s10107-003-0387-5openalex-snapshot
Semidefinite programming relaxations for semialgebraic problems
inferredcites →https://doi.org/10.1016/j.ejor.2003.08.014openalex-snapshot
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
inferredcites →https://doi.org/10.1023/a:1024664432540openalex-snapshot
Global Minimization of a Multivariate Polynomial using Matrix Methods
inferredcites →https://doi.org/10.1090/cbms/097openalex-snapshot
Solving Systems of Polynomial Equations
inferredcites →https://doi.org/10.1090/conm/253/03936openalex-snapshot
Some concrete aspects of Hilbert’s 17th Problem
inferredcites →https://doi.org/10.1090/dimacs/060/08openalex-snapshot
Minimizing polynomial functions
inferredcites →https://doi.org/10.1090/s0002-9947-00-02595-2openalex-snapshot
Polynomials that are positive on an interval
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1137/s1052623498336450openalex-snapshot
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
inferredcites →https://doi.org/10.1145/779359.779363openalex-snapshot
GloptiPoly
inferredcites →https://doi.org/10.1216/rmj-1984-14-4-767openalex-snapshot
An introduction to real algebra
inferredcites →https://doi.org/10.1512/iumj.1993.42.42045openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2048414openalex-extracted
Computing Generalized Nash Equilibria by Polynomial Programming
inferred← citeshttps://doi.org/10.2139/ssrn.2179445openalex-extracted
A Polynomial Optimization Approach to Principal-Agent Problems
inferred← citeshttps://doi.org/10.2139/ssrn.2764140openalex-extracted
Dynamic Principal-Agent Models
inferred← citeshttps://doi.org/10.2139/ssrn.756346openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-32177-2_10openalex-snapshot
Ordered Median Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13111-5_10openalex-snapshot
Ordered Median Location Problems
inferred← citeshttps://doi.org/10.1007/s00158-007-0135-1openalex-snapshot
Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
inferred← citeshttps://doi.org/10.1007/s00186-012-0422-5openalex-snapshot
Computing generalized Nash equilibria by polynomial programming
inferred← citeshttps://doi.org/10.1007/s10107-006-0085-1openalex-snapshot
A semidefinite programming approach to the generalized problem of moments
inferred← citeshttps://doi.org/10.1007/s10107-007-0118-4openalex-snapshot
The K-moment problem with densities
inferred← citeshttps://doi.org/10.1007/s10107-010-0353-yopenalex-snapshot
Semidefinite programming for min–max problems and games
inferred← citeshttps://doi.org/10.1007/s10107-012-0616-xopenalex-snapshot
On convex envelopes for bivariate functions over polytopes
inferred← citeshttps://doi.org/10.1007/s10107-013-0690-8openalex-snapshot
Copositivity and constrained fractional quadratic problems
inferred← citeshttps://doi.org/10.1007/s10107-018-1276-2openalex-snapshot
Tight relaxations for polynomial optimization and Lagrange multiplier expressions
inferred← citeshttps://doi.org/10.1007/s10479-022-04767-4openalex-snapshot
Planning of life-depleting preventive maintenance activities with replacements
inferred← citeshttps://doi.org/10.1007/s10589-019-00141-6openalex-snapshot
Saddle points of rational functions
inferred← citeshttps://doi.org/10.1007/s10898-006-9119-8openalex-snapshot
Global minimization of rational functions and the nearest GCDs
inferred← citeshttps://doi.org/10.1007/s10898-008-9394-7openalex-snapshot
Moments and sums of squares for polynomial optimization and related problems
inferred← citeshttps://doi.org/10.1007/s10898-013-0047-0openalex-snapshot
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
inferred← citeshttps://doi.org/10.1007/s10957-018-1222-8openalex-snapshot
Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data
inferred← citeshttps://doi.org/10.1007/s11263-006-0015-yopenalex-snapshot
Globally Optimal Estimates for Geometric Reconstruction Problems
inferred← citeshttps://doi.org/10.1007/s11425-015-5012-6openalex-snapshot
Equality-constrained minimization of polynomial functions
inferred← citeshttps://doi.org/10.1007/s11590-022-01851-3openalex-snapshot
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
inferred← citeshttps://doi.org/10.1007/s12532-015-0089-zopenalex-snapshot
Minimizing the sum of many rational functions
inferred← citeshttps://doi.org/10.1016/j.bpj.2017.11.3780openalex-snapshot
Steady-State Differential Dose Response in Biological Systems
inferred← citeshttps://doi.org/10.1016/j.cor.2012.10.005openalex-snapshot
Minimizing ordered weighted averaging of rational functions with applications to continuous location
inferred← citeshttps://doi.org/10.1016/j.sigpro.2013.09.021openalex-snapshot
Recent progress on variable projection methods for structured low-rank approximation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.003openalex-snapshot
Approximate GCDs of polynomials and sparse SOS relaxations
inferred← citeshttps://doi.org/10.1017/cbo9781107447226openalex-snapshot
An Introduction to Polynomial and Semi-Algebraic Optimization
inferred← citeshttps://doi.org/10.1017/s0962492904000194openalex-snapshot
Complete search in continuous global optimization and constraint satisfaction
inferred← citeshttps://doi.org/10.1063/5.0210971openalex-snapshot
Maximization of linear independence of basis function products
inferred← citeshttps://doi.org/10.1080/00207170600954889openalex-snapshot
Optimal periodic feedback design for continuous-time LTI systems with constrained control structure
inferred← citeshttps://doi.org/10.1080/10556780802699201openalex-snapshot
GloptiPoly 3: moments, optimization and semidefinite programming
inferred← citeshttps://doi.org/10.1109/acc.2006.1655355openalex-snapshot
Optimal generalized sampled-data hold functions with a constrained structure
inferred← citeshttps://doi.org/10.1109/camsap.2015.7383798openalex-snapshot
Optimization of a Geman-McClure like criterion for sparse signal deconvolution
inferred← citeshttps://doi.org/10.1109/cdc.2004.1428797openalex-snapshot
On parameter-dependent Lyapunov functions for robust stability of linear systems
inferred← citeshttps://doi.org/10.1109/cdc.2006.377306openalex-snapshot
A Necessary and Sufficient Condition for Robust Stability of LTI Discrete-Time Systems using Sum-of-Squares Matrix Polynomials
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434948openalex-snapshot
Rational optimization using sum-of-squares techniques
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739099openalex-snapshot
LQ robust controllers for polynomially uncertain systems
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5620116openalex-snapshot
New fundamental matrix estimation method using global optimization
inferred← citeshttps://doi.org/10.1109/iccv.2005.109openalex-snapshot
Globally optimal estimates for geometric reconstruction problems
inferred← citeshttps://doi.org/10.1109/lra.2025.3527311openalex-snapshot
Gyrevento: Event-Based Omnidirectional Visual Gyroscope in a Manhattan World
inferred← citeshttps://doi.org/10.1109/msp.2025.3557958openalex-snapshot
Quadratic Transform for Fractional Programming in Signal Processing and Machine Learning: A unified approach for solving optimization problems involving ratios
inferred← citeshttps://doi.org/10.1109/t-wc.2008.070824openalex-snapshot
Packet-wise vertical handover for unlicensed multi-standard spectrum access with cognitive radios
inferred← citeshttps://doi.org/10.1109/tac.2007.914238openalex-snapshot
Robust Stability of LTI Systems Over Semialgebraic Sets Using Sum-of-Squares Matrix Polynomials
inferred← citeshttps://doi.org/10.1109/tmtt.2020.3011436openalex-snapshot
A Test for Unconditional Stability Based on Polynomial Convexification
inferred← citeshttps://doi.org/10.1109/tsp.2013.2283839openalex-snapshot
An EM Approach for Time-Variant Poisson-Gaussian Model Parameter Estimation
inferred← citeshttps://doi.org/10.1109/tsp.2018.2890065openalex-snapshot
Rational Optimization for Nonlinear Reconstruction With Approximate $\ell _0$ Penalization
inferred← citeshttps://doi.org/10.1109/tsp.2023.3260560openalex-snapshot
Least-Squares Methods for Nonnegative Matrix Factorization Over Rational Functions
inferred← citeshttps://doi.org/10.1137/03060151xopenalex-snapshot
LMI Approximations for Cones of Positive Semidefinite Forms
inferred← citeshttps://doi.org/10.1137/050623802openalex-snapshot
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
inferred← citeshttps://doi.org/10.1137/20m138541xopenalex-snapshot
Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures
inferred← citeshttps://doi.org/10.1137/21m1456285openalex-snapshot
Rational Generalized Nash Equilibrium Problems
inferred← citeshttps://doi.org/10.1145/1390768.1390792openalex-snapshot
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
inferred← citeshttps://doi.org/10.1145/1837934.1837979openalex-snapshot
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
inferred← citeshttps://doi.org/10.1287/moor.2016.0829openalex-snapshot
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
inferred← citeshttps://doi.org/10.1287/moor.2024.0541openalex-snapshot
Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
inferred← citeshttps://doi.org/10.1360/ssm-2020-0137openalex-snapshot
The quadratic tensor eigenvalue complementarity 问题
inferred← citeshttps://doi.org/10.1553/etna_vol47s127openalex-snapshot
An optimal Q-OR Krylov subspace method for solving linear systems
inferred← citeshttps://doi.org/10.21236/ada462969openalex-snapshot
Enlightened Multiscale Simulation of Biochemical Networks. Core Theory, Validating Experiments, and Implementation in Open Software
inferred← citeshttps://doi.org/10.23919/eusipco.2018.8553174openalex-snapshot
Signal Reconstruction from Sub-sampled and Nonlinearly Distorted Observations
inferred← citeshttps://doi.org/10.3182/20050703-6-cz-1902.01020openalex-snapshot
SUM OF SQUARES RELAXATIONS FOR ROBUST POLYNOMIAL SEMI-DEFINITE PROGRAMS
inferred← citeshttps://doi.org/10.3182/20120711-3-be-2027.00143openalex-snapshot
Structured low-rank approximation as a rational function minimization
inferred← citeshttps://doi.org/10.3982/ecta11351openalex-snapshot
A Polynomial Optimization Approach to Principal-Agent Problems
inferred← citeshttps://doi.org/10.3982/qe960openalex-snapshot
Discrete‐time dynamic principal–agent models: Contraction mapping theorem and computational treatment
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4954openalex-snapshot
Minimizing the sum of many rational functions
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5097openalex-snapshot
NP-Hardness of optimizing the sum of Rational Linear Functions over an Asymptotic-Linear-Program
inferred← citeshttps://doi.org/10.48550/arxiv.1709.03435openalex-snapshot
Positive polynomials on unbounded domains
inferred← citeshttps://doi.org/10.70675/2e9d6fe2z1705z4204zbbaezea86f5846d60openalex-snapshot
Exact algorithms for determinantal varieties and semidefinite programming
inferred← citeshttps://doi.org/10.70675/41d7e520z93b3z411dzae0dzccba4c714c8fopenalex-snapshot
Rational models optimized exactly for solving signal processing problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.