Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.07516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / 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: Q3452586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739782 / 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: Proximal Splitting Methods in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Optimization with Approximate Gradient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact information-based complexity of smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of first-order methods for smooth convex minimization: a novel approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal variant of Kelley's cutting-plane method / 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: On the Convergence of the Proximal Point Algorithm for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is the Subdifferential of the Closed Convex Hull of a Function? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized first-order methods for smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximité et dualité dans un espace hilbertien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-like method for solving rank constrained linear matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / 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: Smooth strongly convex interpolation and exact worst-case performance of first-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Latest revision as of 03:19, 14 July 2024

scientific article; zbMATH DE number 6741605
Language Label Description Also known as
English
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
scientific article; zbMATH DE number 6741605

    Statements

    Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex optimization
    0 references
    composite convex optimization
    0 references
    first-order methods
    0 references
    worst-case analysis
    0 references
    performance estimation
    0 references
    semidefinite programming
    0 references
    convex interpolation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references