Global optimization of rational functions: a semidefinite programming approach
From MaRDI portal
Recommendations
- An algorithm of global optimization for rational functions with rational constraints
- Global optimization of nonconvex polynomial programming problems having rational exponents
- scientific article; zbMATH DE number 1694906
- Global minimization of rational functions and the nearest GCDs
- A parallel global optimization algorithm for rational separable- factorable functions
- On the optimum approximation of real rational functions via linear programming
- Simple global minimization algorithm for one-variable rational functions
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- scientific article; zbMATH DE number 4123538
Cites work
- An introduction to real algebra
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
- Global minimization of a multivariate polynomial using matrix methods
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1560353 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Polynomials that are positive on an interval
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Semidefinite programming relaxations for semialgebraic problems
- The K-moment problem for compact semi-algebraic sets
- Uniform denominators in Hilbert's seventeenth problem
Cited in
(28)- Global optimization of nonconvex polynomial programming problems having rational exponents
- Rational functions with prescribed global and local minimizers
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- An optimal Q-OR Krylov subspace method for solving linear systems
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
- Saddle points of rational functions
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Approximate gcds of polynomials and sparse SOS relaxations
- Computing generalized Nash equilibria by polynomial programming
- Global minimization of rational functions and the nearest GCDs
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Globally optimal estimates for geometric reconstruction problems
- Minimizing the sum of many rational functions
- Optimal periodic feedback design for continuous-time LTI systems with constrained control structure
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- scientific article; zbMATH DE number 4091191 (Why is no real title available?)
- Copositivity and constrained fractional quadratic problems
- Minimizing rational functions: a hierarchy of approximations via pushforward measures
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- An algorithm of global optimization for rational functions with rational constraints
- 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 by exact Jacobian SDP relaxation applicable to finite singularities
- Moments and sums of squares for polynomial optimization and related problems
- Equality-constrained minimization of polynomial functions
- The K-moment problem with densities
- A semidefinite programming approach to the generalized problem of moments
This page was built for publication: Global optimization of rational functions: a semidefinite programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490324)
