Characterizations of optimal solution sets of convex infinite programs
From MaRDI portal
(Redirected from Publication:1024702)
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
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A simple characterization of solutions sets of convex programs
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of solution sets of convex vector minimization problems
- From linear to convex systems: consistency, Farkas' lemma and applications
- Infinite-dimensional convex programming with applications to constrained approximation
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- New Farkas-type constraint qualifications in convex infinite programming
- On characterizing the solution sets of pseudolinear programs
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
Cited in
(30)- 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
- -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
- scientific article; zbMATH DE number 1329072 (Why is no real title available?)
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characterization of solution sets of convex programs
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- 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 robust solution set of convex programs with uncertain data
- Characterizations of solution sets of convex vector minimization problems
- On constraint sets of infinite linear programs over ordered fields
- Sequential subdifferential for multi-composed functions via perturbation approach
- Formulas and applications for the normal cone to the solution set of an infinite convex inequality system with a constraint
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- 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
- Some new properties of the Lagrange function and its applications
- The characterizations of optimal solution set in programming problem under inclusion constrains
- A new approach to characterize the solution set of a pseudoconvex programming problem
- In a semi-infinite program only a countable subset of the constraints is essential
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)
