Characterizations of solution sets of convex vector minimization problems
From MaRDI portal
Recommendations
- Characterizations of optimal solution sets of convex infinite programs
- Characterisations of efficient sets in vector optimisation
- scientific article; zbMATH DE number 2027845
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 4046373 (Why is no real title available?)
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A simple characterization of solutions sets of convex programs
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterization of solution sets of convex programs
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Convex composite multi-objective nonsmooth programming
- Dual conditions characterizing optimality for convex multi-objective programs.
- Generalized convexity and nonsmooth problems of vector optimization
- Ideal, weakly efficient solutions for vector optimization problems
- Inequality systems and global optimization
- Invex functions and generalized convexity in multiobjective programming
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Set containment characterization
- Solvability results for sublinear functions and operators
Cited in
(50)- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Dual characterizations of improvement set in vector optimization
- On characterizations of solution sets of interval-valued quasiconvex programming problems
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- Characterizing robust solution sets of convex programs under data uncertainty
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- On characterizing the solution sets of pseudoinvex extremum problems
- Some dual characterizations of free disposal sets in vector optimization
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of solution sets of cone-constrained convex programming problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Around a Farkas type lemma
- A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Characterization of solution sets of convex programs
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
- Farkas-type theorems and applications: from IPH functions to ICR functions
- An interior proximal method in vector optimization
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Optimality conditions of robust convex multiobjective optimization via \(\epsilon\)-constraint scalarization and image space analysis
- Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces
- On set containment characterizations for sets described by set-valued maps with applications
- A new approach to characterize the solution set of a pseudoconvex programming problem
- On characterizing solution set of non-differentiable \(\eta \)-pseudolinear extremum problem
- On \(\epsilon\)-solutions for robust fractional optimization problems
- Convergence of Minimal Sets in Convex Vector Optimization
- Characterizations of optimal solution sets of convex infinite programs
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- Characterizations of robust solution set of convex programs with uncertain data
- Vector topical functions and Farkas type theorems with applications
- On approximate solutions for robust convex semidefinite optimization problems
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- On approximate efficiency for nonsmooth robust vector optimization problems
- Characterizations of the solution set for tangentially convex optimization problems
- Lower convergence of minimal sets in star-shaped vector optimization problems
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
This page was built for publication: Characterizations of solution sets of convex vector minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503214)
