Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
From MaRDI portal
(Redirected from Publication:494875)
Recommendations
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- On the algorithm of determination of immobile indices for convex SIP problems
- Study of a special nonlinear problem arising in convex semi-infinite programming
- The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Direct theorems in semi-infinite convex programming
- Generalized semi-infinite programming: Theory and methods
- How to solve a semi-infinite optimization problem
- Implicit optimality criterion for convex SIP problem with box constrained index set
- 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 optimality conditions for generalized semi-infinite programming problems
- On sufficient conditions for local optimality in semi-infinite programming
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Second order optimality conditions for generalized semi-infinite programming problems
- Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-infinite programming. Recent advances
- 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
- Study of a special nonlinear problem arising in convex semi-infinite programming
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
Cited in
(6)- Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
- On the algorithm of determination of immobile indices for convex SIP problems
- 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
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets
This page was built for publication: Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494875)
