Characterizations of optimal solution sets of convex infinite programs
From MaRDI portal
Publication:1024702
DOI10.1007/s11750-008-0039-2zbMath1201.90158OpenAlexW1979563734MaRDI QIDQ1024702
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 programs ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Some new properties of the Lagrange function and its applications ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Unnamed Item ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ Semi-infinite optimization under convex function perturbations: Lipschitz stability ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Characteristics of semi-convex frontier optimization ⋮ Simple bilevel programming and extensions ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A simple characterization of solutions sets of convex programs
- Infinite-dimensional convex programming with applications to constrained approximation
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- Characterizations of solution sets of convex vector minimization problems
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Characterization of solution sets of convex programs
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Characterizations of optimal solution sets of convex infinite programs
