Global optimization of rational functions: a semidefinite programming approach
From MaRDI portal
Publication:2490324
DOI10.1007/s10107-005-0589-0zbMath1134.90460OpenAlexW2153451837MaRDI QIDQ2490324
Etienne de Klerk, Dorina Jibetean
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/4162
Related Items
Minimizing the sum of many rational functions, Moments and sums of squares for polynomial optimization and related problems, Approximate gcds of polynomials and sparse SOS relaxations, Globally optimal estimates for geometric reconstruction problems, Computing generalized Nash equilibria by polynomial programming, Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions, Copositivity and constrained fractional quadratic problems, Equality-constrained minimization of polynomial functions, Rational Generalized Nash Equilibrium Problems, Planning of life-depleting preventive maintenance activities with replacements, Semidefinite programming for min-max problems and games, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Solving fractional multicriteria optimization problems with sum of squares convex polynomial data, An optimal Q-OR Krylov subspace method for solving linear systems, The \(K\)-moment problem with densities, Global minimization of rational functions and the nearest GCDs, Matrix sum-of-squares relaxations for robust semi-definite programs, A semidefinite programming approach to the generalized problem of moments, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Saddle points of rational functions, Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Optimal periodic feedback design for continuous-time LTI systems with constrained control structure
Uses Software
Cites Work
- An introduction to real algebra
- The \(K\)-moment problem for compact semi-algebraic sets
- Global minimization of a multivariate polynomial using matrix methods
- Semidefinite programming relaxations for semialgebraic problems
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Uniform denominators in Hilbert's seventeenth problem
- Global Optimization with Polynomials and the Problem of Moments
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Polynomials that are positive on an interval
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- GloptiPoly
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
