Enlarging the region of convergence of Newton's method for constrained optimization

DOI10.1007/BF00933831zbMath0453.65045MaRDI QIDQ1149235

Dimitri P. Bertsekas

Publication date: 1982

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

zbMATH Keywords

Newton's methodpenalty functionssuperlinear convergenceconstrained minimizationdifferentiable exact penalty functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (only showing first 100 items - show all)

Numerical optimization for the purification of polluted shallow waters ⋮ A modified augmented Lagrangian method for a class of constrained problems ⋮ A proximal-based deomposition method for compositions method for convex minimization problems ⋮ Efficient optimization of certain functionals in a hypercube ⋮ Interior dual proximal point algorithm for linear programs ⋮ Convergence of line search methods for unconstrained optimization ⋮ Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function ⋮ A class of augmented Lagrangians for equality constraints in nonlinear programming problems ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ Geometric approach to Fletcher's ideal penalty function ⋮ A geometric projection-space reconstruction algorithm ⋮ Descent methods with linesearch in the presence of perturbations ⋮ A parallel algorithm for constrained optimization problems ⋮ Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework ⋮ Recent developments in constrained optimization ⋮ Delamination of composites as a substationarity problem: Numerical approximation and algorithms ⋮ Variational principles, FE and MPT for analysis of nonlinear impact-contact problems ⋮ A gradient-related algorithm with inexact line searches ⋮ A note on the use of vector barrier parameters for interior-point methods ⋮ Newton's method and its use in optimization ⋮ On almost smooth functions and piecewise smooth functions ⋮ A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization ⋮ Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems ⋮ A differential game approach to the dynamic mixed behavior traffic network equilibrium problem ⋮ A smooth penalty function algorithm for network-structured problems ⋮ New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems ⋮ Convergence of a continuous approach for zero-one programming problems ⋮ Numerical solution for bounding feasible point sets ⋮ An implementable augmented Lagrange method for solving fixed point problems with coupled constraints ⋮ A new augmented Lagrangian function for inequality constraints in nonlinear programming problems ⋮ Inexact smoothing method for large scale minimax optimization ⋮ A nonlinear augmented Lagrangian for constrained minimax problems ⋮ A new fast method to compute saddle-points in constrained optimization and applications ⋮ A new exact exponential penalty function method and nonconvex mathematical programming ⋮ Approximate receding horizon approach for Markov decision processes: average reward case ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ Uniform approximation of min/max functions by smooth splines ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ Solving fuzzy inequalities with concave membership functions ⋮ Newton-type methods for nonlinearly constrained programming problems-algorithms and theory ⋮ A smoothing trust-region Newton-CG method for minimax problem ⋮ On a stress resultant geometrically exact shell model. IV: Variable thickness shells with through-the-thickness stretching ⋮ Compensated convexity and its applications ⋮ A globally convergent Levenberg-Marquardt method for equality-constrained optimization ⋮ A new constrained fixed-point algorithm for ordering independent components ⋮ An augmented Lagrangian approach with a variable transformation in nonlinear programming ⋮ An efficient computational method for real time multibody dynamic simulation in fully Cartesian coordinates ⋮ A numerical method for incompressible viscous flow simulation ⋮ Polynomial programming using multi-homogeneous polynomial continuation ⋮ On the approximate augmented Lagrangian for nonlinear symmetric cone programming ⋮ A diagonal quadratic approximation method for large scale linear programs ⋮ On the accurate identification of active set for constrained minimax problems ⋮ Quasi-incompressible finite elasticity in principal stretches. Continuum basis and numerical algorithms ⋮ Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems ⋮ Weighted skeletons and fixed-share decomposition ⋮ A primal-dual proximal point algorithm for constrained convex programs ⋮ Self-organizing maps and clustering methods for matrix data ⋮ Complementary energy approach to contact problems based on consistent augmented Lagrangian formulation ⋮ Two-level primal-dual proximal decomposition technique to solve large scale optimization problems ⋮ A new descent algorithm with curve search rule ⋮ An implementation of Newton-like methods on nonlinearly constrained networks ⋮ Recursive approximation of the high dimensional max function ⋮ A new semi-penalty method for nonlinear programming ⋮ An efficient method for nonlinearly constrained networks ⋮ Solving mathematical programs with fuzzy equilibrium constraints ⋮ A sequential cutting plane algorithm for solving convex NLP problems ⋮ Stochastic set packing problem ⋮ Variational piecewise constant level set methods for shape optimization of a two-density drum ⋮ Cohesive-zone laws for void growth. I: Experimental field projection of crack-tip crazing in glassy polymers ⋮ Global convergence on an active set SQP for inequality constrained optimization ⋮ An intelligent genetic algorithm designed for global optimization of multi-minima functions ⋮ Augmented Lagrangian method applied to American option pricing ⋮ An adaptive Newton algorithm for optimal control problems with application to optimal electrode design ⋮ Solving constrained optimization problems using a novel genetic algorithm ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ An approach for solving fuzzy implicit variational inequalities with linear membership functions ⋮ Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design ⋮ An optimal control approach to nonlinear mixed integer programming problems ⋮ A hybrid global optimization method: The multi-dimensional case ⋮ Convergence of a splitting inertial proximal method for monotone operators ⋮ Engineering applications of discrete time optimal control ⋮ Solving min-max problems and linear semi-infinite programs ⋮ Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones ⋮ On iterative algorithms for linear least squares problems with bound constraints ⋮ Exact penalty functions method for mathematical programming problems involving invex functions ⋮ A simple complexity proof for a polynomial-time linear programming algorithm ⋮ Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations ⋮ Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems ⋮ Exact energy and momentum conserving algorithms for general models in nonlinear elasticity ⋮ Decomposition for structured convex programs with smooth multiplier methods ⋮ Solving variational inequalities in a fuzzy environment ⋮ Communication protocols for secure distributed computation of binary functions. ⋮ Algorithmic symmetrization of Coulomb frictional problems using augmented Lagrangians ⋮ A perturbed Lagrangian formulation for the finite element solution of contact problems ⋮ A hybrid global optimization method: The one-dimensional case ⋮ On differentiable exact penalty functions ⋮ An efficient finite element method for treating singularities in Laplace's equation ⋮ A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set ⋮ A new approach of fitting biomass dynamics models to data ⋮ Descent methods for monotone equilibrium problems in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A globally convergent method for nonlinear programming
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Properties of updating methods for the multipliers in augmented Lagrangians
• A multiplier method with automatic limitation of penalty growth
• A New Class of Augmented Lagrangians in Nonlinear Programming
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Algorithms for nonlinear constraints that use lagrangian functions
• A first order, exact penalty function algorithm for equality constrained optimization problems
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

This page was built for publication: Enlarging the region of convergence of Newton's method for constrained optimization