Optimality criteria without constraint qualifications for linear semidefinite problems
From MaRDI portal
Publication:690528
DOI10.1007/S10958-012-0734-2zbMATH Open1263.90055OpenAlexW1983769620WikidataQ57677642 ScholiaQ57677642MaRDI QIDQ690528FDOQ690528
Authors: O. I. Kostyukova, Tatiana V. Tchemisova 
Publication date: 28 November 2012
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/8433
Recommendations
- A practical optimality condition without constraint qualifications for nonlinear programming
- Optimality conditions in semidefinite programming
- Optimality conditions for nonconvex semidefinite programming
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- scientific article; zbMATH DE number 5662944
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- scientific article; zbMATH DE number 7546024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-Infinite Programming: Theory, Methods, and Applications
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Semidefinite programming for discrete optimization and matrix completion problems
- Extremal problems on the set of nonnegative definite matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Strong Duality for Semidefinite Programming
- A simplified test for optimality
- Some results about the facial geometry of convex semi-infinite systems
- On the algorithm of determination of immobile indices for convex SIP problems
- Sufficient optimality conditions for convex semi-infinite programming
- Title not available (Why is that?)
- Optimality conditions for convex semi-infinite programming problems
- Characterizations of optimality without constraint qualification for the abstract convex program
Cited In (10)
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- On the algorithm of determination of immobile indices for convex SIP problems
- Optimality conditions in semidefinite programming
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- On strong duality in linear copositive programming
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- An exact explicit dual for the linear copositive programming problem
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Title not available (Why is that?)
This page was built for publication: Optimality criteria without constraint qualifications for linear semidefinite problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690528)
