Characterizations of the solution set for nonconvex semi-infinite programming problems
From MaRDI portal
Recommendations
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Characterizations of optimal solution sets of convex infinite programs
- scientific article; zbMATH DE number 6500667
Cited in
(28)- Characterizations of optimal solution sets of convex infinite programs
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Painlevé-Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems
- Characterizations of the solution set for non-essentially quasiconvex programming
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
- Characterizations of solution sets of differentiable quasiconvex programming problems
- The characterizations of optimal solution set in programming problem under inclusion constrains
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Characteristics of semi-convex frontier optimization
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- scientific article; zbMATH DE number 3848992 (Why is no real title available?)
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- 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
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Characterizations of the solution set of nonsmooth semi-infinite programming problems on Hadamard manifolds
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems
- Characterizing robust -optimal solution sets for uncertain convex optimization problems
- Characterizations of solution sets of nonsmooth mathematical programming problems
- Study of a special nonlinear problem arising in convex semi-infinite programming
This page was built for publication: Characterizations of the solution set for nonconvex semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953986)
