Convergence Properties of Algorithms for Nonlinear Optimization

From MaRDI portal
Publication:3026775

DOI10.1137/1028154zbMath0624.90091OpenAlexW1993192928MaRDI QIDQ3026775

M. J. D. Powell

Publication date: 1986

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1028154



Related Items

Some modified conjugate gradient methods for unconstrained optimization, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method, A conjugate gradient type method for the nonnegative constraints optimization problems, New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems, Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method, A globally convergent version of the Polak-Ribière conjugate gradient method, Convergence properties of the dependent PRP conjugate gradient methods, Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions, Delamination of composites as a substationarity problem: Numerical approximation and algorithms, Global convergence of a modified conjugate gradient method, A distributed conjugate gradient online learning method over networks, A new variant of the memory gradient method for unconstrained optimization, A new class of nonlinear conjugate gradient coefficients with global convergence properties, Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions, A penalty-free method with superlinear convergence for equality constrained optimization, Global convergence of a nonlinear conjugate gradient method, The projection technique for two open problems of unconstrained optimization problems, A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties, A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions, Generalized RMIL conjugate gradient method under the strong Wolfe line search with application in image processing, Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization, Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search, Nonlinear robust optimization via sequential convex bilevel programming, A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization, Globally convergent modified Perry's conjugate gradient method, Global convergence of a semi-infinite optimization method, Conjugate gradient methods using quasi-Newton updates with inexact line searches, A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems, A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches, Numerical experiments with the one-dimensional non-linear simplex search, A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method, A note on global convergence result for conjugate gradient methods, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Dai-Kou type conjugate gradient methods with a line search only using gradient, A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update, A practical PR+ conjugate gradient method only using gradient, A modified three-term PRP conjugate gradient algorithm for optimization models, Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems, A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems, A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing, Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems, A Two-Term PRP-Based Descent Method, Unnamed Item, Unnamed Item, Unnamed Item, Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization, Local convergence of filter methods for equality constrained non-linear programming, Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems, A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition, Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search, A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems, The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems, A conjugate gradient algorithm and its applications in image restoration, A Kalman-tracking filter approach to nonlinear programming, A modified PRP conjugate gradient method, The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique, The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions, A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems, A truncated descent HS conjugate gradient method and its global convergence, An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix, The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems, A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions, An adaptive conjugate gradient learning algorithm for efficient training of neural networks, Conjugate gradient methods with Armijo-type line searches.