Convergence Properties of Algorithms for Nonlinear Optimization
From MaRDI portal
conjugate gradientsconstrained optimizationrate of convergencesurveytrust regionvariable metric algorithm
Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30)
Recommendations
Cited in
(79)- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP conjugate gradient method
- A truncated descent HS conjugate gradient method and its global convergence
- Numerical experiments with the one-dimensional non-linear simplex search
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- An adaptive conjugate gradient learning algorithm for efficient training of neural networks
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Conjugate gradient methods with Armijo-type line searches.
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Delamination of composites as a substationarity problem: Numerical approximation and algorithms
- A new variant of the memory gradient method for unconstrained optimization
- 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
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- 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
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- A distributed conjugate gradient online learning method over networks
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- A penalty-free method with superlinear convergence for equality constrained optimization
- The projection technique for two open problems of unconstrained optimization problems
- A practical PR+ conjugate gradient method only using gradient
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- 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
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- 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
- A conjugate gradient type method for the nonnegative constraints optimization problems
- Global convergence of a modified conjugate gradient method
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Nonlinear robust optimization via sequential convex bilevel programming
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- A note on global convergence result for conjugate gradient methods
- Remarks on convergence in probability.
- Some modified conjugate gradient methods for unconstrained optimization
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Local convergence of filter methods for equality constrained non-linear programming
- A trust region algorithm with conjugate gradient technique for optimization problems
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- scientific article; zbMATH DE number 13215 (Why is no real title available?)
- Global convergence of a nonlinear conjugate gradient method
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- scientific article; zbMATH DE number 1296794 (Why is no real title available?)
- Globally convergent modified Perry's conjugate gradient method
- Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- scientific article; zbMATH DE number 3997045 (Why is no real title available?)
- A modified three-term WYL conjugate gradient method
- An improved PRP type spectral conjugate gradient method with restart steps
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- On the Convergence of an Optimization Algorithm Based on Nonlinear Operators
- Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization
- 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 modified three-term PRP conjugate gradient algorithm for optimization models
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- A Two-Term PRP-Based Descent Method
- 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 three-term conjugate gradient methods on general functions under a new inexact line search strategy
- Another modified version of RMIL conjugate gradient method
- Globally linearly convergent nonlinear conjugate gradients without Wolfe line search
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- Global convergence of a WYL type spectral conjugate gradient method
- Nonnegative Low-Rank Matrix Correction under an Orthogonality Constraint in Conservative Vlasov Simulations
- Modified stochastic conjugate gradient algorithm in machine learning
- A Kalman-tracking filter approach to nonlinear programming
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Convergence properties of the dependent PRP conjugate gradient methods
- Global convergence of a semi-infinite optimization method
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
This page was built for publication: Convergence Properties of Algorithms for Nonlinear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026775)
