First order solutions in conic programming
From MaRDI portal
Publication:890175
DOI10.1007/s00186-015-0513-1zbMath1327.90201OpenAlexW2175590530WikidataQ59401671 ScholiaQ59401671MaRDI QIDQ890175
Bolor Jargalsaikhan, Georg Still, Mirjam Dür
Publication date: 9 November 2015
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-015-0513-1
linear semi-infinite programmingconic programsfirst order maximizerstability of first order maximizers
Related Items (2)
Generalized polarity and weakest constraint qualifications in multiobjective optimization ⋮ A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On stable uniqueness in linear semi-infinite optimization
- Strong unicity and alternation for linear optimization
- On the geometry of stable compact convex sets
- Complementarity and nondegeneracy in semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints
- Unicity in linear optimization
- On the connection of facially exposed and nice cones
- Copositive programming via semi-infinite optimization
- Genericity Results in Linear Conic Programming—A Tour d’Horizon
- Semi-Infinite Programming: Theory, Methods, and Applications
- Generic Optimality Conditions for Semialgebraic Convex Programs
- On the Matrix Equation X′X = A
- Facially Exposed Cones Are Not Always Nice
- On the generic properties of convex optimization problems in conic form
This page was built for publication: First order solutions in conic programming
