A geometric method in nonlinear programming

DOI10.1007/BF00934495zbMath0396.90078OpenAlexW2020706127MaRDI QIDQ1253613

K. Appert

Publication date: 1980

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934495

zbMATH Keywords

Nonlinear ProgrammingComparison Of AlgorithmsGradient Projection MethodSystem of Nonlinear Equations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical computation of solutions to systems of equations (65H10)

Related Items (30)

Riemannian optimization and multidisciplinary design optimization ⋮ Stable barrier-projection and barrier-Newton methods in linear programming ⋮ Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data ⋮ Continuous algorithms for solution of convex optimization problems and finding saddle points of contex-coneave functions with the use of projection operations ⋮ Nonlinear coordinate representations of smooth optimization problems ⋮ An ODE method of solving nonlinear programming ⋮ The regularization continuation method with an adaptive time step control for linearly constrained optimization problems ⋮ Adaptive Newton-type schemes based on projections ⋮ Geometric notes on optimization with equality constraints ⋮ A convergence of ODE method in constrained optimization ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Gradient Flow Finite Element Discretisations with Energy-Based Adaptivity for Excited States of Schrödinger's Equation ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ Minimizing a differentiable function over a differential manifold ⋮ Global existence of real roots and random Newton flow algorithm for nonlinear system of equations ⋮ A subdivision method for computing nearest gcd with certification ⋮ Distributed constrained optimization via continuous-time mirror design ⋮ Minimum problems on differentiable manifolds ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization ⋮ Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations ⋮ An optimization framework of biological dynamical systems ⋮ An adaptive Newton-method based on a dynamical systems approach ⋮ Constrained optimization: Projected gradient flows ⋮ Primal central paths and Riemannian distances for convex sets ⋮ Continuous analogue to iterative optimization for PDE-constrained inverse problems ⋮ On the stability of globally projected dynamical systems ⋮ Null space gradient flows for constrained optimization with applications to shape optimization ⋮ Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations ⋮ Gradient systems associated with probability distributions

Cites Work

• Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations
• A class of quadratically convergent algorithms for constrained function minimization
• Multiplier methods: A survey
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• On the combination of the multiplier method of Hestenes and Powell with Newton's method
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Multiplier and gradient methods
• On the method of multipliers for mathematical programming problems
• Unconstrained approach to the extremization of constrained functions
• A new approach to constrained function optimization
• The multiplier method of Hestenes and Powell applied to convex programming
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations
• A variable metric algorithm for constrained minimization based on an augmented Lagrangian
• Extremization of functions with equality constraints
• An exact penalty function for nonlinear programming with inequalities
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Methods for Modifying Matrix Factorizations
• The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems
• On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A geometric method in nonlinear programming