Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
DOI10.1007/s00245-018-9502-0zbMath1464.90049OpenAlexW2803205395WikidataQ124815433 ScholiaQ124815433MaRDI QIDQ1987329
Gabriel Cárcamo, Stephanie Caro, Fabián Flores-Bazan
Publication date: 14 April 2020
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-018-9502-0
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Dynamic programming (90C39) Duality theory (optimization) (49N15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- S-lemma with equality and its applications
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Linear inequalities and quadratic forms
- A linear programming reformulation of the standard quadratic optimization problem
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- 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
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- Zero duality gaps in infinite-dimensional programming
- On standard quadratic optimization problems
- Criteria for copositive matrices of order four
- Global and local quadratic minimization
- Global escape strategies for maximizing quadratic forms over a simplex
- 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
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On copositive matrices
- A gentle, geometric introduction to copositive optimization
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Copositive programming via semi-infinite optimization
- Copositivity for second-order optimality conditions in general smooth optimization problems
- An improved characterisation of the interior of the completely positive cone
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Continuous Characterizations of the Maximum Clique Problem
- On the Convexity of the Value Function for a Class of Nonconvex Variational Problems: Existence and Optimality Conditions
- Strong Duality in Cone Constrained Nonconvex Optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New Farkas-type constraint qualifications in convex infinite programming
- Nonlinear Programming
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- Convex Analysis
- On Cones of Nonnegative Quadratic Functions
- A Survey of the S-Lemma
- Set-valued analysis
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
