On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-014-9672-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971664328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong local convergence properties of adaptive regularized methods for nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: cubic regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / 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: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the regularization parameter in the adaptive cubic regularization algorithm / 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: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Gauss–Newton scheme with worst case guarantees for global performance / 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: Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine conjugate adaptive Newton methods for nonlinear elastomechanics / rank
 
Normal rank

Latest revision as of 17:08, 9 July 2024

scientific article
Language Label Description Also known as
English
On the use of iterative methods in cubic regularization for unconstrained optimization
scientific article

    Statements

    On the use of iterative methods in cubic regularization for unconstrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 February 2015
    0 references
    unconstrained optimization
    0 references
    cubic regularization
    0 references
    worst-case complexity
    0 references
    matrix-free subproblem solvers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers