Optimality criteria without constraint qualifications for linear semidefinite problems
type: Item
instance of: scholarly article
title: Optimality criteria without constraint qualifications for linear semidefinite problems
zbMATH Open document ID: 1263.90055
author: O. I. Kostyukova
author: Tatiana V. Tchemisova
published in: Journal of Mathematical Sciences (New York)
publication date: 2012-11-28T00:00:00Z
full work available at URL: http://hdl.handle.net/10773/8433
review text: The authors develop optimality conditions for convex semi-infinite programming problems, and in particular for linear semidefinite programming (SDP). The first-order conditions are geometric in nature, and they do not rely on standard constraint qualifications.
reviewed by: Didier Henrion
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6110731
zbMATH Keywords: optimality conditions
Wikidata QID: Q57677642
MaRDI profile type: Publication
OpenAlex ID: W1983769620
cites work: A simplified test for optimality
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Optimality conditions for convex semi-infinite programming problems
cites work: Q4503250
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: Some results about the facial geometry of convex semi-infinite systems
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Sufficient optimality conditions for convex semi-infinite programming
cites work: Q3542466
cites work: Q4324980
cites work: Strong Duality for Semidefinite Programming
cites work: Extremal problems on the set of nonnegative definite matrices
cites work: Q3840144
cites work: Semidefinite programming for discrete optimization and matrix completion problems
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1007/S10958-012-0734-2
Recommended article: A practical optimality condition without constraint qualifications for nonlinear programming
Recommended article: Optimality Conditions in Semidefinite Programming
Recommended article: Optimality conditions for nonconvex semidefinite programming
Recommended article: Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Recommended article: Optimality conditions and global convergence for nonlinear semidefinite programming
Recommended article: Constraint qualifications in linear vector semi-infinite optimization
Recommended article: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Recommended article: Q5852066
Recommended article: Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
Recommended article: Q5083070
description: scientific article; zbMATH DE number 6110731