Characterizations of optimal solution sets of convex infinite programs
From MaRDI portal
Publication:1024702
DOI10.1007/S11750-008-0039-2zbMATH Open1201.90158OpenAlexW1979563734MaRDI QIDQ1024702FDOQ1024702
Authors: 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
Recommendations
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterization of solution sets of convex programs
- scientific article; zbMATH DE number 2027845
Cites Work
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations of solution sets of convex vector minimization problems
- New Farkas-type constraint qualifications in convex infinite programming
- A simple characterization of solutions sets of convex programs
- On characterizing the solution sets of pseudolinear programs
- From linear to convex systems: consistency, Farkas' lemma and applications
- Infinite-dimensional convex programming with applications to constrained approximation
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Characterization of solution sets of convex programs
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Title not available (Why is that?)
Cited In (29)
- Characterizing robust solution sets of convex programs under data uncertainty
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterization of solution sets of convex programs
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characteristics of semi-convex frontier optimization
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Simple bilevel programming and extensions
- Optimal solution characterization for infinite positive semi-definite programming
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- On constraint sets of infinite linear programs over ordered fields
- Sequential subdifferential for multi-composed functions via perturbation approach
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
- Some new properties of the Lagrange function and its applications
- The characterizations of optimal solution set in programming problem under inclusion constrains
- In a semi-infinite program only a countable subset of the constraints is essential
- A new approach to characterize the solution set of a pseudoconvex programming problem
This page was built for publication: Characterizations of optimal solution sets of convex infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024702)
