A survey of hidden convex optimization
From MaRDI portal
Publication:2176821
DOI10.1007/s40305-019-00286-5zbMath1449.90294arXiv1902.10921OpenAlexW2997544175WikidataQ126411969 ScholiaQ126411969MaRDI QIDQ2176821
Publication date: 5 May 2020
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.10921
quadratic programmingsemidefinite programmingconvex programmingfractional programmingLagrangian dualquadratic matrix programming
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Fractional programming (90C32)
Related Items (11)
On box-constrained total least squares problem ⋮ Toward nonquadratic S-lemma: new theory and application in nonconvex optimization ⋮ On the generalized trace ratio problem ⋮ A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints ⋮ Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications ⋮ Linear Programming on the Stiefel Manifold ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Non-quadratic extension of homogeneous S-lemma and its applications in optimization ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ On local nonglobal minimum of trust-region subproblem and extension
Cites Work
- S-lemma with equality and its applications
- A linear-time algorithm for trust region problems
- A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- The generalized trust region subproblem
- Quadratic optimization over a second-order cone with linear equality constraints
- On local convexity of quadratic transformations
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- On the convexification of nonlinear programming problems: An applications-oriented survey
- A survey for the quadratic assignment problem
- A sequential method for a class of pseudoconcave fractional problems
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- Quadratically constrained least squares and quadratic problems
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Nondifferentiable optimization and polynomial problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Efficiently solving total least squares with Tikhonov identical regularization
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Quadratic programs with hollows
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Hidden convex minimization
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- Zero duality gap for a class of nonconvex optimization problems
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Convexity of quadratic transformations and its use in control and optimization
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Parametric Lagrangian dual for the binary quadratic programming problem
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients
- Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints
- On minimizing a quadratic function on Stiefel manifold
- Recent advances in trust region algorithms
- On the complexity of quadratic programming with two quadratic constraints
- Feasibility testing for systems of real quadratic equations
- Tightening a copositive relaxation for standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Local saddle point and a class of convexification methods for nonconvex optimization problems
- Towards strong duality in integer programming
- The trust region subproblem with non-intersecting linear constraints
- A generalized solution of the orthogonal Procrustes problem
- \(NP\)-hardness of linear multiplicative programming and related problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- A Note on Polynomial Solvability of the CDT Problem
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Strong duality in optimization: shifted power reformulation
- On the Solution of the GPS Localization and Circle Fitting Problems
- The Legendre–Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
- On the Ball-Constrained Weighted Maximin Dispersion Problem
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity
- Some NP-complete problems in quadratic and nonlinear programming
- Computing Optimal Locally Constrained Steps
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Fractional Programming. I, Duality
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Theory and application of p-regularized subproblems for p>2
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Computation of Minimum-Volume Covering Ellipsoids
- Programming with linear fractional functionals
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Convex Relaxations of the Weighted Maxmin Dispersion Problem
- Quadratic Matrix Programming
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
- Convexification, concavification and monotonization in global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey of hidden convex optimization
