Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
type: Item
instance of: scholarly article
title: Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
zbMATH Open document ID: 1327.90213
author: O. I. Kostyukova
author: Tatiana V. Tchemisova
published in: Set-Valued and Variational Analysis
publication date: 2015-09-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6477753
zbMATH Keywords: semi-infinite programming (SIP)
zbMATH Keywords: constraint qualifications (CQ)
zbMATH Keywords: lower level problem (SIP)
zbMATH Keywords: immobile index
zbMATH Keywords: immobility order
zbMATH Keywords: optimality conditions
zbMATH Keywords: nonlinear programming (NLP)
MaRDI profile type: Publication
full work available at URL: s11228-015-0320-0
OpenAlex ID: W2014136579
Wikidata QID: Q114859162
cites work: Q4503250
cites work: Direct theorems in semi-infinite convex programming
cites work: Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
cites work: DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
cites work: On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
cites work: Algorithm for discovering the set of all the solutions of a linear programming problem
cites work: Abadie-type constraint qualification for mathematical programs with equilibrium constraints
cites work: Semi-infinite programming. Recent advances
cites work: Numerical treatment of a class of semi‐infinite programming problems
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Second order optimality conditions for generalized semi-infinite programming problems
cites work: On sufficient conditions for local optimality in semi-infinite programming
cites work: Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications
cites work: Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
cites work: Implicit optimality criterion for convex SIP problem with box constrained index set
cites work: On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
cites work: Study of a special nonlinear problem arising in convex semi-infinite programming
cites work: Stability of the feasible set for linear inequality systems: A carrier index set approach
cites work: Semi-infinite programming
cites work: Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
cites work: Second-order optimality conditions in generalized semi-infinite programming
cites work: Semi-infinite programming, duality, discretization and optimality conditions†
cites work: How to solve a semi-infinite optimization problem
cites work: On optimality conditions for generalized semi-infinite programming problems
cites work: Generalized semi-infinite programming: Theory and methods
DOI: 10.1007/S11228-015-0320-0
description: scientific article; zbMATH DE number 6477753