Pages that link to "Item:Q1610311"

The following pages link to A Frank--Wolfe type theorem for convex polynomial programs (Q1610311):

Displaying 49 items.

• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Minimum recession-compatible subsets of closed convex sets (Q421277) (← links)
• Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• Solution existence and stability of quadratically constrained convex quadratic programs (Q691471) (← links)
• On the solution existence and stability of quadratically constrained nonconvex quadratic programs (Q723498) (← links)
• Solution maps of polynomial variational inequalities (Q785633) (← links)
• On the solution existence to convex polynomial programs and its applications (Q828698) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
• Existence of global minima for constrained optimization (Q857595) (← links)
• Set intersection theorems and existence of optimal solutions (Q879966) (← links)
• On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
• SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• On the solution existence of nonconvex quadratic programming problems in Hilbert spaces (Q1696189) (← links)
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
• Global error bounds for piecewise convex polynomials (Q1942267) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities (Q2025289) (← links)
• Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
• Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
• On the solution existence and stability of polynomial optimization problems (Q2136888) (← links)
• Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
• On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
• Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
• Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
• Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
• (Q4557933) (← links)
• On a Frank-Wolfe type theorem in cubic optimization (Q4634164) (← links)
• (Q4642622) (← links)
• On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
• Optimality Conditions for Minimizers at Infinity in Polynomial Programming (Q5108246) (← links)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
• Solution sets of three sparse optimization problems for multivariate regression (Q6064025) (← links)
• Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets (Q6092525) (← links)