Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
From MaRDI portal
Publication:2420815
DOI10.1007/s10957-019-01486-yzbMath1414.90310OpenAlexW2914169482WikidataQ128490392 ScholiaQ128490392MaRDI QIDQ2420815
Cristián Vera, Giandomenico Mastroeni, Fabián Flores-Bazan
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/1023052
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)
Related Items
Quasi-relative interiors for graphs of convex set-valued mappings, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, On the existence of weak efficient solutions of nonconvex vector optimization problems, Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization, Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization, Some topics in vector optimization via image space analysis, Optimality conditions for vector optimization problems with non-cone constraints in image space, On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Image convexity of generalized systems with infinite-dimensional image and applications
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Generalized Motzkin theorems of the alternative and vector optimization problems
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- An improved definition of proper efficiency for vector maximization with respect to cones
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Notions of relative interior in Banach spaces
- Characterizations via linear scalarization of minimal and properly minimal elements
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Separation theorem based on the quasirelative interior and application to duality theory
- Theorems of the alternative and optimality conditions
- Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- Quasi-interior points and the extension of linear functionals
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Ordered linear spaces
- On the use of the quasi-relative interior in optimization
- Gordan-Type Alternative Theorems and Vector Optimization Revisited
- Optimality Conditions and Image Space Analysis for Vector Optimization Problems
- A unified vector optimization problem: complete scalarizations and applications
- Duality in Vector Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- The theorem of the alternative, the key-theorem, and the vector-maximum problem
- Proper Efficient Points for Maximizations with Respect to Cones
- Strong Duality in Cone Constrained Nonconvex Optimization
- Convex Analysis
- On the mapping of quadratic forms
- Separation Properties of Convex Cones
