Characterizations of optimal solution sets of convex infinite programs

From MaRDI portal
Publication:1024702

DOI10.1007/s11750-008-0039-2zbMath1201.90158OpenAlexW1979563734MaRDI QIDQ1024702

J. Martínez

Publication date: 17 June 2009

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-008-0039-2




Related Items (17)

An approach to characterizing \(\epsilon\)-solution sets of convex programsCharacterizations of robust solution set of convex programs with uncertain data\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraintsSome new properties of the Lagrange function and its applicationsA new approach to characterize the solution set of a pseudoconvex programming problemCharacterizations of solution sets of differentiable quasiconvex programming problemsCharacterizing the solution set of convex optimization problems without convexity of constraintsUnnamed ItemWeak stability and strong duality of a class of nonconvex infinite programs via augmented LagrangianSemi-infinite optimization under convex function perturbations: Lipschitz stability\(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functionsCharacterizing robust solution sets of convex programs under data uncertaintyCharacteristics of semi-convex frontier optimizationSimple bilevel programming and extensions\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraintsCharacterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential SubdifferentialsSome characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints



Cites Work


This page was built for publication: Characterizations of optimal solution sets of convex infinite programs