Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127827289, #quickstatements; #temporary_batch_1721950759712
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963307318 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.07164 / 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: Convergence of Trust-Region Methods Based on Probabilistic Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data / 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: Optimization Methods for Large-Scale Machine Learning / 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: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / 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: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for second-order optimality in unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic optimization using a trust-region method and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods for Finding a Trust-region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem using the Lanczos Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving trust-region and other regularised subproblems in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive Formula-trust-region method for bound-constrained nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and global rates of trust-region methods based on probabilistic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for trust region problems / 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: Stochastic derivative-free optimization using a trust region framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tt>trlib</tt>: a vector-free implementation of the GLTR method for iterative solution of the trust region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithms for Matrices and Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the cubic regularization of Newton's method on convex problems / 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: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data completion and stochastic algorithms for PDE inversion problems with many measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms for Inverse Problems Involving PDEs and many Measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-sampled Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessing Stochastic Algorithms for Large Scale Nonlinear Least Squares Problems Using Extremal Probabilities of Linear Combinations of Gamma Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method with a Model Trust Region Modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Matrix Concentration Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Advertising: Techniques for Targeting Relevant Ads / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127827289 / rank
 
Normal rank

Latest revision as of 01:49, 26 July 2024

scientific article
Language Label Description Also known as
English
Newton-type methods for non-convex optimization under inexact Hessian information
scientific article

    Statements

    Newton-type methods for non-convex optimization under inexact Hessian information (English)
    0 references
    0 references
    21 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    non-convex optimization
    0 references
    inexact Hessian
    0 references
    trust region
    0 references
    cubic regularization
    0 references
    randomized numerical linear algebra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references