Characterizing a class of robust vector polynomial optimization via sum of squares conditions
From MaRDI portal
Publication:6161553
DOI10.1007/s10957-023-02184-6zbMath1519.90163OpenAlexW4323049091MaRDI QIDQ6161553
Xiang-Kai Sun, Kok Lay Teo, Wen Tan
Publication date: 27 June 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02184-6
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17) Polynomial optimization (90C23)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Some applications of polynomial optimization in operations research and real-time decision making
- Robust multiple objective game theory
- A convex polynomial that is not sos-convex
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Semidefinite representation of convex sets
- Conjugate duality in convex optimization
- Robust convex quadratically constrained programs
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Characterizations for optimality conditions of general robust optimization problems
- Robust optimization-methodology and applications
- Some geometric results in semidefinite programming
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- A sufficient condition for asymptotically well behaved property of convex polynomials
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- On approximate solutions and saddle point theorems for robust convex optimization
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Radius of robust feasibility of system of convex inequalities with uncertain data
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On robust multiobjective optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Lectures on Modern Convex Optimization
- WHAT IS...a Spectrahedron?
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Polynomial Matrix Inequality and Semidefinite Representation
- Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- LMI Techniques for Optimization Over Polynomials in Control: A Survey
- Generalized robust duality in constrained nonconvex optimization
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
- Convex Analysis
This page was built for publication: Characterizing a class of robust vector polynomial optimization via sum of squares conditions
