One-step and multistep procedures for constrained minimization problems

DOI10.1093/imanum/20.1.135zbMath0945.65065MaRDI 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 convergence; one-step method; regularity condition; constrained minimization; multistep method; smooth minimization

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

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