An inexact proximal regularization method for unconstrained optimization (Q522090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Study of a primal-dual algorithm for equality constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: From global to local convergence of interior methods for nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization / 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: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization / 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: A regularized Newton method for monotone nonlinear equations and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descentwise inexact proximal algorithms for smooth optimization / 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 Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adaptive inexact proximal point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact proximal point algorithms and descent methods in 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: Regularized Newton method for unconstrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact and nonmonotone proximal method for smooth unconstrained minimization / 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: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization / 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: Q2765625 / rank
 
Normal rank

Latest revision as of 17:08, 13 July 2024

scientific article
Language Label Description Also known as
English
An inexact proximal regularization method for unconstrained optimization
scientific article

    Statements

    An inexact proximal regularization method for unconstrained optimization (English)
    0 references
    0 references
    0 references
    13 April 2017
    0 references
    regularized Newton method
    0 references
    unconstrained optimization
    0 references
    0 references
    0 references

    Identifiers