Sufficient optimality conditions for convex semi-infinite programming

DOI10.1080/10556780902992803zbMath1220.90143OpenAlexW2042555537WikidataQ57677661 ScholiaQ57677661MaRDI QIDQ3562400

O. I. Kostyukova, Tatiana V. Tchemisova

Publication date: 21 May 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780902992803

zbMATH Keywords

optimality conditionsconstraint qualifications (CQ)nonlinear programming (NLP)semi-infinite programming (SIP)convex programming (CP)

Mathematics Subject Classification ID

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

Related Items (7)

A stochastic approximation method for convex programming with many semidefinite constraints ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Unnamed Item ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ γ-Active Constraints in Convex Semi-Infinite Programming

This page was built for publication: Sufficient optimality conditions for convex semi-infinite programming