A Frank--Wolfe type theorem for convex polynomial programs

DOI10.1023/A:1014813701864zbMath1029.90054OpenAlexW1585205451MaRDI QIDQ1610311

E. G. Belousov, Diethard Klatte

Publication date: 19 August 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014813701864

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (49)

On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ On the solution existence to convex polynomial programs and its applications ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ On the solution existence and stability of polynomial optimization problems ⋮ Robust optimization and data classification for characterization of Huntington disease onset via duality methods ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Existence of global minima for constrained optimization ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Set intersection theorems and existence of optimal solutions ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets ⋮ Optimality Conditions for Minimizers at Infinity in Polynomial Programming ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ On the solution existence of nonconvex quadratic programming problems in Hilbert spaces ⋮ Global error bounds for piecewise convex polynomials ⋮ Minimum recession-compatible subsets of closed convex sets ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ On a Frank-Wolfe type theorem in cubic optimization ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Solving fractional multicriteria optimization problems with sum of squares convex polynomial data ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Solution existence and stability of quadratically constrained convex quadratic programs ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ A new class of alternative theorems for SOS-convex inequalities and robust optimization ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Unnamed Item ⋮ A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints ⋮ On the solution existence and stability of quadratically constrained nonconvex quadratic programs ⋮ On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes ⋮ On boundedness of (quasi-)convex integer optimization problems ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ Solution maps of polynomial variational inequalities ⋮ Unnamed Item

This page was built for publication: A Frank--Wolfe type theorem for convex polynomial programs