Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
From MaRDI portal
Publication:494875
DOI10.1007/s11228-015-0320-0zbMath1327.90213OpenAlexW2014136579WikidataQ114859162 ScholiaQ114859162MaRDI QIDQ494875
Tatiana V. Tchemisova, O. I. Kostyukova
Publication date: 2 September 2015
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-015-0320-0
optimality conditionsconstraint qualifications (CQ)immobile indeximmobility orderlower level problem (SIP)nonlinear programming (NLP)semi-infinite programming (SIP)
Related Items
Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets, Immobile indices and CQ-free optimality criteria for linear copositive programming problems, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
Cites Work
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Study of a special nonlinear problem arising in convex semi-infinite programming
- Semi-infinite programming
- Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications
- On optimality conditions for generalized semi-infinite programming problems
- Generalized semi-infinite programming: Theory and methods
- Stability of the feasible set for linear inequality systems: A carrier index set approach
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Implicit optimality criterion for convex SIP problem with box constrained index set
- How to solve a semi-infinite optimization problem
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
- Semi-Infinite Programming: Theory, Methods, and Applications
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Semi-infinite programming, duality, discretization and optimality conditions†
- Direct theorems in semi-infinite convex programming
- On sufficient conditions for local optimality in semi-infinite programming
- Second order optimality conditions for generalized semi-infinite programming problems
- Numerical treatment of a class of semi‐infinite programming problems
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-infinite programming. Recent advances
