One-step and multistep procedures for constrained minimization problems

DOI10.1093/imanum/20.1.135zbMath0945.65065OpenAlexW2042876482MaRDI QIDQ4943402

Johannes Schropp

Publication date: 5 October 2000

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/20.1.135

zbMATH Keywords

global convergenceone-step methodregularity conditionconstrained minimizationmultistep methodsmooth minimization

Mathematics Subject Classification ID

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

Related Items (12)

Non Monotone Backtracking Inexact BFGS Method for Regression Analysis ⋮ The global convergence of the BFGS method with a modified WWP line search for nonconvex functions ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Global convergence of a modified Broyden family method for nonconvex functions ⋮ Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization ⋮ A dynamical system method for solving nonlinear ill-posed problems ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ New line search methods for unconstrained optimization ⋮ Constrained optimization: Projected gradient flows ⋮ Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization ⋮ One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization

This page was built for publication: One-step and multistep procedures for constrained minimization problems