Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
From MaRDI portal
Publication:2278887
DOI10.1007/s10957-019-01554-3zbMath1472.90104OpenAlexW2957673300WikidataQ127519220 ScholiaQ127519220MaRDI QIDQ2278887
Wang Chen, Zhiang Zhou, Yang, Xinmin
Publication date: 11 December 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01554-3
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
A kind of equivalence of three nonlinear scalarization functions in vector optimization, Conditional gradient method for vector optimization, Nonlinear separation methods and applications for vector equilibrium problems using improvement sets, A scalarization scheme for binary relations with applications to set-valued and robust optimization, A unified approach through image space analysis to robustness in uncertain optimization problems, Tykhonov well-posedness of split problems, The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to constrained optimization via image space analysis
- Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
- Optimality conditions for generalized Ky Fan quasi-inequalities with applications
- Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
- Weak \(E\)-optimal solution in vector optimization
- Unified duality theory for constrained extremum problems. I: Image space analysis
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- Stability and scalarization in vector optimization using improvement sets
- Nonlinear scalarization characterizations of \(e\)-efficiency in vector optimization
- Nearly subconvexlike set-valued maps and vector optimization problems
- Vector optimization problems via improvement sets
- Nonlinear separation concerning \(E\)-optimal solution of constrained multi-objective optimization problems
- Characterizations of preinvex and prequasiinvex set-valued maps
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Image space analysis and scalarization of multivalued optimization
- Characterizations of convex and quasiconvex set-valued maps
- Nonlinear separation in the image space with applications to constrained optimization
- Separation functions and optimality conditions in vector optimization
- Separations and optimality of constrained multiobjective optimization via improvement sets
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- Nonlinear separation approach to constrained extremum problems
- Generalized penalty method for elliptic variational-hemivariational inequalities
- Improvement sets and vector optimization
- Optimization problems for a viscoelastic frictional contact problem with unilateral constraints
- Unified optimality conditions for set-valued optimizations
- Optimal control for a class of mixed variational problems
- Improvement sets and convergence of optimal points
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- On the optimal control of variational-hemivariational inequalities
- Existence and Convergence of Optimal Points with Respect to Improvement Sets
- Vector equilibrium problems under improvement sets and linear scalarization with stability applications
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- E-Benson proper efficiency in vector optimization
- e-weak minimal solutions of vector optimization problems with set-valued maps
