Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (Q2821800): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3397674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Damped techniques for the limited memory BFGS method for large-scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the linearized Bregman iteration for ℓ₁-norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Sparsity Incoherence for Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of quadratic splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a two-parameter family of conjugate gradient methods without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of Several Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Convergence of the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse and Redundant Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence conditions for restarted conjugate gradient methods with inaccurate line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth analysis of singular values. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth analysis of singular values. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Piecewise Convex Quadratic Programs and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limited memory BFGS method for large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generalized conjugate gradient algorithms. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative proofs of the convergence properties of the conjugate- gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linearized Bregman iteration for compressive sensing and sparse denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear constraints that use lagrangian functions / 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: Some continuity properties of polyhedral multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Regularization of Polyhedral Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm of nonlinear conjugate gradient method with strong convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient hybrid conjugate gradient techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the subdifferential of some matrix norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Generalizations of the Linearized Bregman Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly convex programming for exact matrix completion and robust principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization / rank
 
Normal rank

Latest revision as of 15:24, 12 July 2024

scientific article
Language Label Description Also known as
English
Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions
scientific article

    Statements

    Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (English)
    0 references
    0 references
    23 September 2016
    0 references
    linear convergence
    0 references
    restricted strong convexity
    0 references
    error bound
    0 references
    quadratic splines
    0 references
    conjugate gradient
    0 references
    gradient descent method
    0 references
    conjugate gradient method
    0 references
    Broyden-Fletcher-Goldfarb-Shanno method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers