scientific article; zbMATH DE number 6985433
From MaRDI portal
Publication:4557933
zbMath1429.90085MaRDI QIDQ4557933
Thai Doan Chuong, Vaithilingam Jeyakumar
Publication date: 27 November 2018
Full work available at URL: http://www.heldermann.de/JCA/JCA25/JCA254/jca25073.htm#jca251
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
SDP relaxationrobust optimizationsemi-infinite convex programsemidefinite linear programconvex polynomial
Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (7)
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- On polynomial optimization over non-compact semi-algebraic sets
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- On general minimax theorems
- Semidefinite representation of convex sets
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Zero duality gaps in infinite-dimensional programming
- Robust convex quadratically constrained programs
- A Frank--Wolfe type theorem for convex polynomial programs
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- An algorithm for semi-infinite polynomial optimization
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Semidefinite relaxations for semi-infinite polynomial programming
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Theory and Applications of Robust Optimization
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On solving a class of linear semi-infinite programming by SDP method
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- Convex Analysis
This page was built for publication:
