An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
From MaRDI portal
Publication:5299903
DOI10.1080/10556788.2012.656114zbMath1273.90198OpenAlexW1979463193MaRDI QIDQ5299903
Robert M. Freund, X. Andy Sun, Dimitris J. Bertsimas
Publication date: 24 June 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/87686
global optimizationpolynomial optimizationsemidefinite programming relaxationaccelerated first-order methods
Related Items
On the convergence rate of scaled gradient projection method, Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Introductory lectures on convex optimization. A basic course.
- Semidefinite programming relaxations for semialgebraic problems
- A semidefinite optimization approach to the steady-state analysis of queueing systems
- Global Optimization with Polynomials and the Problem of Moments
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- First-Order Methods for Sparse Covariance Selection
- An Augmented Primal-Dual Method for Linear Conic Programs
- Smooth Optimization Approach for Sparse Covariance Selection
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- GloptiPoly
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
