A characterization of proper minimal points as solutions of sublinear optimization problems
The concept of ``proper solutions for optimization problems in some different formulations is considered and a comparison between them is done. In the first sections of the article one proves some basic results regarding cone separation and sublinear functionals induced by cones. Further, one provides necessary and sufficient conditions for a proper minimal point of being a solution for a scalar optimization problem and necessary conditions for proper minimality in locally convex spaces respectively normed spaces.
- Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization
- Proper solutions of vector optimization problems
- A Characterization of Properly Minimal Elements of a Set
- Characterization of solutions of multiobjective optimization problem
- A nonlinear scalarization characterization of (C, )-proper solutions in vector optimization
- On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency
- Characterizations via linear scalarization of minimal and properly minimal elements
- On some methods to derive necessary and sufficient optimality conditions in vector optimization
- Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems
- New generalized convexity notion for set-valued maps and application to vector optimization
- Duality results for generalized vector variational inequalities with set-valued maps
- Approximate Benson efficient solutions for set-valued equilibrium problems
- Remarks on some variants of minimal point theorem and Ekeland variational principle with applications
- Existence and characterization theorems in nonconvex vector optimization
- On the existence and stability of approximate solutions of perturbed vector equilibrium problems
- Characterization of properly optimal elements with variable ordering structures
- Duality for vector optimization problems via a general scalarization
- Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini
- scientific article; zbMATH DE number 3883087 (Why is no real title available?)
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- A Characterization of Properly Minimal Elements of a Set
- Super Efficiency in Vector Optimization
- scientific article; zbMATH DE number 1294390 (Why is no real title available?)
- Nearly subconvexlike set-valued maps and vector optimization problems
- On proper minimality in set optimization
- Approximate Benson properly efficient solutions for set-valued equilibrium problems
- Optimality conditions for Benson proper efficiency of set-valued equilibrium problems
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Some characterizations of ideal points in vector optimization problems
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- Approximate duality for vector quasi-equilibrium problems and applications
- Ekeland's principle and nuclear cones: a geometrical aspect
This page was built for publication: A characterization of proper minimal points as solutions of sublinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310861)