A globally convergent Levenberg-Marquardt method for equality-constrained optimization
type: Item
instance of: scholarly article
title: A globally convergent Levenberg-Marquardt method for equality-constrained optimization
zbMATH Open document ID: 1411.90323
author: A. F. Izmailov
author: M. V. Solodov
author: E. I. Uskov
published in: Computational Optimization and Applications
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K15
zbMATH DE Number: 7043480
zbMATH Keywords: Newton-type methods
zbMATH Keywords: Levenberg-Marquardt method
zbMATH Keywords: stabilized sequential quadratic programming
zbMATH Keywords: local convergence
zbMATH Keywords: global convergence
zbMATH Keywords: penalty function
MaRDI profile type: Publication
full work available at URL: s10589-018-0038-7
OpenAlex ID: W2895651721
cites work: Q3690580
cites work: Enlarging the region of convergence of Newton's method for constrained optimization
cites work: A New Class of Augmented Lagrangians in Nonlinear Programming
cites work: Benchmarking optimization software with performance profiles.
cites work: A family of Newton methods for nonsmooth constrained systems with nonisolated solutions
cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
cites work: An inexact restoration strategy for the globalization of the sSQP method
cites work: Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
cites work: Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions
cites work: A stabilized SQP method: global convergence
cites work: Stabilized sequential quadratic programming
cites work: On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
cites work: Stabilized SQP revisited
cites work: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
cites work: Newton-Type Methods for Optimization and Variational Problems
cites work: Combining stabilized SQP with the augmented Lagrangian algorithm
cites work: Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
cites work: Subspace-stabilized sequential quadratic programming
cites work: Q5491447
cites work: Superlinear convergence of a stabilized SQP method to a degenerate solution
cites work: Modifying SQP for Degenerate Problems
cites work: Q2765625
DOI: 10.1007/S10589-018-0038-7
description: scientific article; zbMATH DE number 7043480