Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
From MaRDI portal
Publication:1987329
Recommendations
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Copositivity aspects of standard quadratic optimization problems
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
Cites work
- A gentle, geometric introduction to copositive optimization
- A linear programming reformulation of the standard quadratic optimization problem
- A Survey of the S-Lemma
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An improved characterisation of the interior of the completely positive cone
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
- Continuous Characterizations of the Maximum Clique Problem
- Convex Analysis
- Copositive programming via semi-infinite optimization
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Criteria for copositive matrices of order four
- Global and local quadratic minimization
- Global escape strategies for maximizing quadratic forms over a simplex
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 912567 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- scientific article; zbMATH DE number 3368525 (Why is no real title available?)
- Interior points of the completely positive cone
- Linear inequalities and quadratic forms
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- New Farkas-type constraint qualifications in convex infinite programming
- Nonlinear Programming
- On Cones of Nonnegative Quadratic Functions
- On copositive matrices
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization 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
- On the convexity of the value function for a class of nonconvex variational problems: existence and optimality conditions
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- S-lemma with equality and its applications
- Set-valued analysis
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Strong duality in cone constrained nonconvex optimization
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Zero duality gaps in infinite-dimensional programming
Cited in
(7)- Characterizing existence of minimizers and optimality to nonconvex quadratic integrals
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Toward nonquadratic S-lemma: new theory and application in nonconvex optimization
- Non-quadratic extension of homogeneous S-lemma and its applications in optimization
- Connectivity of quadratic hypersurfaces and its applications in optimization. I: General theory
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
This page was built for publication: Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987329)
