High-order Newton-penalty algorithms
DOI10.1016/J.CAM.2004.11.043zbMATH Open1077.65061OpenAlexW2015985877MaRDI QIDQ557745FDOQ557745
Authors: Jean-Pierre Dussault 
Publication date: 30 June 2005
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2004.11.043
Recommendations
convergenceNewton methodinterior point algorithmsquadratic penalty functionPredictor-corrector methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Stability and Efficiency of Penalty Algorithms
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Augmented penalty algorithms
- On the superlinear convergence order of the logarithmic barrier algorithm
- Global convergence technique for the Newton method with periodic Hessian evaluation
Cited In (7)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Fast unconditionally stable 2-D analysis of non-conjugate gear contacts using an explicit formulation of the meshing equations
- Direct analytical solution of a modified form of the meshing equations in two dimensions for non-conjugate gear contact
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Implementation issues for high-order algorithms
- La différentiation automatique et son utilisation en optimisation
This page was built for publication: High-order Newton-penalty algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557745)
