Solvability of a regular polynomial vector optimization problem without convexity
DOI10.1080/02331934.2021.1990285OpenAlexW3206924904MaRDI QIDQ5882837FDOQ5882837
Authors: Danyang Liu, Rong Hu, Ya Ping Fang
Publication date: 17 March 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.03739
Recommendations
- scientific article; zbMATH DE number 7753348
- Some results on regularity in vector optimization
- Existence of Pareto solutions for vector polynomial optimization problems with constraints
- On the solution existence to convex polynomial programs and its applications
- Regularity conditions in vector optimization
stabilityregularity conditionnon-convexityFrank-Wolfe type theorempolynomial vector optimization problem
Multi-objective and goal programming (90C29) Sensitivity, stability, well-posedness (49K40) Polynomial optimization (90C23)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The vector complementary problem and its equivalences with the weak minimal element in ordered spaces
- Vector complementarity and minimal element problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Variational principles for set-valued mappings with applications to multiobjective optimization
- Title not available (Why is that?)
- Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems
- Vector equilibrium problems under asymptotic analysis
- Quasicomplementarity problems of type \(R_ 0\)
- Title not available (Why is that?)
- On the existence of Pareto solutions for polynomial vector optimization problems
- Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones
- The upper semicontinuity of the solution maps in vector implicit quasicomplementarity problems of type \(R_{0}^{*1}\)
- Stability results for polyhedral complementarity problems
- Genericity in Polynomial Optimization
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Notes on the optimization problems corresponding to polynomial complementarity problems
- A Note on the Nonemptiness and Compactness of Solution Sets of Weakly Homogeneous Variational Inequalities
- On the solution existence and stability of polynomial optimization problems
- On the nonemptiness and boundedness of solution sets of weakly homogeneous optimization problems
- Asymptotically bounded multifunctions and the MCP beyond copositivity
- On the upper semi-continuity of the solution map to the vertical implicit homogeneous complementarity problem of type \(R_{0}\)
Cited In (2)
This page was built for publication: Solvability of a regular polynomial vector optimization problem without convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882837)