An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-021-00274-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Finding approximate local minima faster than gradient descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / 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: On the use of iterative methods in cubic regularization for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Methods for NonConvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5361279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the trust region subproblem based on hidden convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-021-00274-7 / rank
 
Normal rank

Latest revision as of 21:15, 16 December 2024

scientific article
Language Label Description Also known as
English
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
scientific article

    Statements

    An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2021
    0 references
    cubic regularization subproblem
    0 references
    first-order methods
    0 references
    constrained convex optimization
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references

    Identifiers