Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
From MaRDI portal
Publication:1682971
DOI10.1007/s10957-017-1150-zzbMath1386.90104OpenAlexW2745186512MaRDI QIDQ1682971
O. I. Kostyukova, Tatiana V. Tchemisova
Publication date: 6 December 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/21072
optimality conditionsconvex programmingconvex setconstraint qualifications (CQ)immobile indexnonlinear programming (NLP)semi-infinite programming (SIP)finitely representable set
Related Items (8)
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ 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 ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Unnamed Item ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices ⋮ Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- Optimality criteria without constraint qualifications for linear semidefinite problems
- On relaxing the Mangasarian-Fromovitz constraint qualification
- Semi-infinite programming
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
- An algorithm for the global optimization of a class of continuous minimax problems
- First-order optimality conditions in generalized semi-infinite programming
- Semi-infinite optimization: Structure and stability of the feasible set
- Bi-level strategies in semi-infinite programming.
- On optimality conditions for generalized semi-infinite programming problems
- On regularity and stability in semi-infinite optimization
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Implicit optimality criterion for convex SIP problem with box constrained index set
- On existence and uniqueness of stationary points in semi-infinite optimization
- Copositive programming via semi-infinite optimization
- Semidefinite relaxations for semi-infinite polynomial programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Infinite kernel learning via infinite and semi-infinite programming
- Some results about the facial geometry of convex semi-infinite systems
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Second order optimality conditions for generalized semi-infinite programming problems
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
