Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
From MaRDI portal
Recommendations
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterizations of optimal solution sets of convex infinite programs
- Non-convex semi-infinite min-max optimization with noncompact sets
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- The characterizations of optimal solution set in programming problem under inclusion constrains
Cited in
(21)- Characterizations of optimal solution sets of convex infinite programs
- In a semi-infinite program only a countable subset of the constraints is essential
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of solution sets of convex vector minimization problems
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- scientific article; zbMATH DE number 3848992 (Why is no real title available?)
- \(\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
- \(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- On solution set for semidefinite optimization problems
- Study of a special nonlinear problem arising in convex semi-infinite programming
This page was built for publication: Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3106488)
