First order solutions in conic programming

DOI10.1007/S00186-015-0513-1MaRDI QIDQ890175zbMATH OpenOpenAlexWikidataFDO

Authors Bolor Jargalsaikhan, Georg Still, Mirjam Dür

Publication date 9 November 2015

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00186-015-0513-1

zbMATH Keywords

linear semi-infinite programmingconic programsfirst order maximizerstability of first order maximizers

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34)

Recommendations

• First-order methods for convex optimization
• First–order cone apporximations and necessary optimality conditions
• Quadratic optimization over one first-order cone
• scientific article; zbMATH DE number 4110472
• First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
• First-order methods in optimization
• First-order algorithms for optimization problems with orthogonality constraints
• Primal-dual first-order methods for a class of cone programming
• A first order method for solving convex bilevel optimization problems
• Optimization problems and first order approximated optimization problems

Cites work

• scientific article; zbMATH DE number 3941265 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 1534289 (Why is no real title available?)
• Complementarity and nondegeneracy in semidefinite programming
• Copositive programming via semi-infinite optimization
• Facially exposed cones are not always nice
• First and second order analysis of nonlinear semidefinite programs
• Generic optimality conditions for semialgebraic convex programs
• Genericity results in linear conic programming -- a tour d'horizon
• On stable uniqueness in linear semi-infinite optimization
• On the Matrix Equation X′X = A
• On the connection of facially exposed and nice cones
• On the generic properties of convex optimization problems in conic form
• On the geometry of stable compact convex sets
• Semi-Infinite Programming: Theory, Methods, and Applications
• Strong unicity and alternation for linear optimization
• Unicity in linear optimization
• Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints

Cited in

(3)

• Generalized polarity and weakest constraint qualifications in multiobjective optimization
• On the weakest constraint qualification for sharp local minimizers
• A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system

This page was built for publication: First order solutions in conic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890175)