On High-order Model Regularization for Constrained Optimization (Q4602340): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:33, 30 July 2024

scientific article; zbMATH DE number 6823613

Language	Label	Description	Also known as
English	On High-order Model Regularization for Constrained Optimization	scientific article; zbMATH DE number 6823613

Statements

scholarly article

0 references

On High-order Model Regularization for Constrained Optimization (English)

0 references

SIAM Journal on Optimization

0 references

publication date

10 January 2018

0 references

zbMATH Keywords

nonlinear programming

0 references

high-order regularization

0 references

complexity

0 references

José Mario Martínez

0 references

MaRDI profile type

MaRDI publication profile

0 references

On sequential optimality conditions for smooth constrained optimization

0 references

A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences

0 references

0 references

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

0 references

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

0 references

Practical Augmented Lagrangian Methods for Constrained Optimization

0 references

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

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

Introduction to Derivative-Free Optimization

0 references

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

0 references

0 references

Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations

0 references

Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds

0 references

On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

0 references

Strict convex regularizations, proximal points and augmented lagrangians

0 references

Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization

0 references

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

0 references

Cubic regularization of Newton method and its global performance

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Tensor Methods for Unconstrained Optimization Using Second Derivatives

0 references

A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS<sup>*</sup>

0 references

Affine conjugate adaptive Newton methods for nonlinear elastomechanics

0 references

full work available at URL

https://doi.org/10.1137/17m1115472

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/17M1115472

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4602340

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