Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
type: Item
instance of: scholarly article
title: Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
zbMATH Open document ID: 1464.90049
author: Gabriel Cárcamo
author: Stephanie Caro
author: Fabián Flores-Bazan
published in: Applied Mathematics and Optimization
publication date: 2020-04-14T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 7189269
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: quadratic programming
zbMATH Keywords: copositivity
zbMATH Keywords: hidden convexity
zbMATH Keywords: strong duality
zbMATH Keywords: S-lemma
MaRDI profile type: Publication
full work available at URL: s00245-018-9502-0
OpenAlex ID: W2803205395
Wikidata QID: Q124815433
cites work: Copositive programming via semi-infinite optimization
cites work: Set-valued analysis
cites work: Nonlinear Programming
cites work: 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
cites work: Global and local quadratic minimization
cites work: Global escape strategies for maximizing quadratic forms over a simplex
cites work: On standard quadratic optimization problems
cites work: Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
cites work: Copositivity for second-order optimality conditions in general smooth optimization problems
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: On copositive programming and standard quadratic optimization problems
cites work: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
cites work: A gentle, geometric introduction to copositive optimization
cites work: Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
cites work: A linear programming reformulation of the standard quadratic optimization problem
cites work: An improved characterisation of the interior of the completely positive cone
cites work: New Farkas-type constraint qualifications in convex infinite programming
cites work: Q3497912
cites work: Q5503714
cites work: Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
cites work: On the Convexity of the Value Function for a Class of Nonconvex Variational Problems: Existence and Optimality Conditions
cites work: Strong Duality in Cone Constrained Nonconvex Optimization
cites work: Q3179447
cites work: Linear inequalities and quadratic forms
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: On copositive matrices
cites work: Permanently going back and forth between the ``quadratic world'' and the ``convexity world'' in optimization
cites work: Q4286721
cites work: Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
cites work: Zero duality gaps in infinite-dimensional programming
cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
cites work: Q4887226
cites work: Some applications of the image space analysis to the duality theory for constrained extremum problems
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: Criteria for copositive matrices of order four
cites work: A Survey of the S-Lemma
cites work: Convex Analysis
cites work: Q4050397
cites work: On Cones of Nonnegative Quadratic Functions
cites work: S-lemma with equality and its applications
cites work: Q5641059
DOI: 10.1007/S00245-018-9502-0
description: scientific article; zbMATH DE number 7189269