An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems (Q5299903): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
Normal rank
 
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sostools / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979463193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite optimization approach to the steady-state analysis of queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods for Sparse Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Augmented Primal-Dual Method for Linear Conic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Optimization Approach for Sparse Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:15, 6 July 2024

scientific article; zbMATH DE number 6179985
Language Label Description Also known as
English
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
scientific article; zbMATH DE number 6179985

    Statements

    An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    polynomial optimization
    0 references
    semidefinite programming relaxation
    0 references
    accelerated first-order methods
    0 references
    global optimization
    0 references

    Identifiers