Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite relaxations for the block model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Laplacian matrices and convex relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Simplicity and Conditioning of Low Rank Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of minimizing compositions of convex functions and smooth maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of convergence of the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Convergence Rates for the Proximal Bundle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Spectral Optimization via Gauge Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Hölder smooth convergence rates follow from specialized rates assuming growth bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse networks via Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral bundle method with bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral bundle method with second-order information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of proximal bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxation methods for community detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order bundle method to minimize the maximum eigenvalue function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Optimization of Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Sketching Algorithms for Low-Rank Matrix Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A useful variant of the Davis–Kahan theorem for statisticians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Semidefinite Programming / rank
 
Normal rank

Revision as of 17:40, 1 August 2024

scientific article; zbMATH DE number 7711102
Language Label Description Also known as
English
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
scientific article; zbMATH DE number 7711102

    Statements

    Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (English)
    0 references
    0 references
    0 references
    12 July 2023
    0 references
    semidefinite programs
    0 references
    spectral bundle method
    0 references
    convergence rates
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers