A regularized Newton method without line search for unconstrained optimization (Q742310): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-014-9656-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127175988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Symmetric Indefinite Linear Equation Solvers / 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: A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On second order conditions for quasiconvexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / 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: Regularized Newton methods for convex minimization problems with singular solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated regularized Newton method for convex minimizations / 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: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized Newton method for unconstrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularized Newton method for degenerate unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularized Newton method without line search for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765625 / rank
 
Normal rank

Latest revision as of 02:06, 9 July 2024

scientific article
Language Label Description Also known as
English
A regularized Newton method without line search for unconstrained optimization
scientific article

    Statements

    A regularized Newton method without line search for unconstrained optimization (English)
    0 references
    0 references
    0 references
    18 September 2014
    0 references
    0 references
    regularized Newton method
    0 references
    global complexity bound
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    0 references
    0 references
    0 references