Pages that link to "Item:Q2910878"

The following pages link to Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization (Q2910878):

Displaying 16 items.

• Lower bounds on the global minimum of a polynomial (Q461443) (← links)
• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
• Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
• Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
• Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
• Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
• Polynomial Norms (Q4620456) (← links)
• Algorithm 996 (Q4960955) (← links)
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints (Q5254992) (← links)
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
• T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization (Q6606854) (← links)