On large-scale unconstrained optimization and arbitrary regularization (Q2070329)

From MaRDI portal

Revision as of 20:15, 27 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On large-scale unconstrained optimization and arbitrary regularization	scientific article

Statements

scholarly article

0 references

On large-scale unconstrained optimization and arbitrary regularization (English)

0 references

0 references

José Mario Martínez

0 references

Computational Optimization and Applications

0 references

publication date

24 January 2022

0 references

zbMATH Keywords

smooth unconstrained minimization

0 references

regularization

0 references

Newton-type methods

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10589-021-00322-2

0 references

On the use of the energy norm in trust-region and adaptive cubic regularization subproblems

0 references

A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis

0 references

A spectral conjugate gradient method for unconstrained optimization

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

Inexact spectral projected gradient methods on convex sets

0 references

On the use of third-order models with fourth-order regularization for unconstrained optimization

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

0 references

On Regularization and Active-set Methods with Complexity for Constrained Optimization

0 references

A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

0 references

Testing Unconstrained Optimization Software

0 references

Cubic regularization of Newton method and its global performance

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10589-021-00322-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2070329

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2070329&oldid=36760187"