A Frank--Wolfe type theorem for convex polynomial programs

From MaRDI portal
Publication:1610311

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




Related Items

On duality gap with polynomial multipliers for polynomial optimization problemsGeneralized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimizationOn the solution existence to convex polynomial programs and its applicationsOptimizing over the properly efficient set of convex multi-objective optimization problemsFinding efficient solutions in robust multiple objective optimization with SOS-convex polynomial dataOn the solution existence and stability of polynomial optimization problemsRobust optimization and data classification for characterization of Huntington disease onset via duality methodsOn conic QPCCs, conic QCQPs and completely positive programsExistence of global minima for constrained optimizationOn Radius of Robust Feasibility for Convex Conic Programs with Data UncertaintySOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimizationConvergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactnessFrom error bounds to the complexity of first-order descent methods for convex functionsSet intersection theorems and existence of optimal solutionsError bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence ratesSolution sets of three sparse optimization problems for multivariate regressionConvergence of an SDP hierarchy and optimality of robust convex polynomial optimization problemsΓ‐robust linear complementarity problems with ellipsoidal uncertainty setsOptimality Conditions for Minimizers at Infinity in Polynomial ProgrammingExact SDP relaxations for classes of nonlinear semidefinite programming problemsOn the solution existence of nonconvex quadratic programming problems in Hilbert spacesGlobal error bounds for piecewise convex polynomialsMinimum recession-compatible subsets of closed convex setsConvex generalized Nash equilibrium problems and polynomial optimizationOn the complexity of testing attainment of the optimal value in nonlinear optimizationDual semidefinite programs without duality gaps for a class of convex minimax programsOn a Frank-Wolfe type theorem in cubic optimizationA hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomialsSolving fractional multicriteria optimization problems with sum of squares convex polynomial dataExact conic programming relaxations for a class of convex polynomial cone programsOn minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraintA geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraintsSolution existence and stability of quadratically constrained convex quadratic programsFeasible partition problem in reverse convex and convex mixed-integer programmingRobust SOS-convex polynomial optimization problems: exact SDP relaxationsA new class of alternative theorems for SOS-convex inequalities and robust optimizationA new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programsUnnamed ItemA Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalitiesFinding efficient solutions for multicriteria optimization problems with SOS-convex polynomialsRadius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraintsOn the solution existence and stability of quadratically constrained nonconvex quadratic programsOn generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmesOn boundedness of (quasi-)convex integer optimization problemsMulti-objective convex polynomial optimization and semidefinite programming relaxationsExistence of Pareto solutions for vector polynomial optimization problems with constraintsCopositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization ProblemsSolution maps of polynomial variational inequalitiesUnnamed Item