A second-order method for the general nonlinear programming problem
type: Item
instance of: scholarly article
title: A second-order method for the general nonlinear programming problem
zbMATH Open document ID: 0373.90067
DOI: 10.1007/BF00933150
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3581924
MaRDI profile type: Publication
cites work: The Weierstrass E-Function in the Calculus of Variations
cites work: Multiplier and gradient methods
cites work: Q5590418
cites work: A new method for the optimization of a nonlinear function subject to nonlinear constraints
cites work: The method of penalty estimates for conditional extremum problems
cites work: On the method of multipliers for mathematical programming problems
cites work: Use of the augmented penalty function in mathematical programming problems. I
cites work: On the combination of the multiplier method of Hestenes and Powell with Newton's method
cites work: On Penalty and Multiplier Methods for Constrained Minimization
cites work: On the method of multipliers for convex programming
cites work: Q4099846
cites work: A new approach to constrained function optimization
cites work: A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: A general saddle point result for constrained optimization
cites work: Q5635266
cites work: An exact penalty function for nonlinear programming with inequalities
cites work: Q5684514
cites work: On the global stabilization of locally convergent algorithms
cites work: A second-order method for unconstrained optimization
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: An Arc Method for Nonlinear Programming
cites work: Q4051876
cites work: A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
cites work: Newton’s Method for Optimization Problems with Equality Constraints
full work available at URL: https://doi.org/10.1007/bf00933150
OpenAlex ID: W1987778712
description: scientific article; zbMATH DE number 3581924