Convergence Conditions for Ascent Methods
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A truncated descent HS conjugate gradient method and its global convergence
- An efficient line search for nonlinear least squares
- Stepsize analysis for descent methods
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- On three-term conjugate gradient algorithms for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Solution of eigenvalue problems in Hilbert spaces by a gradient method
- Convergence proof of minimization algorithms for nonconvex functions
- Approximation methods for the unconstrained optimization
- Numerically stable computation of step-sizes for descent methods. The nonconvex case
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
- A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks
- Convergence properties of the Beale-Powell restart algorithm
- MERLIN-3. 0. A multidimensional optimization environment
- Modifying the BFGS update by a new column scaling technique
- Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Convergence of implementable descent algorithms for unconstrained optimization
- Direct search methods: Then and now
- A robust descent type algorithm for geophysical inversion through adaptive regularization
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Useful redundancy in parameter and time delay estimation for continuous-time models
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- A note on the Morozov principle via Lagrange duality
- A class of one parameter conjugate gradient methods
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- On the nonmonotonicity degree of nonmonotone line searches
- Smoothed _1-regularization-based line search for sparse signal recovery
- Accelerated double direction method for solving unconstrained optimization problems
- A novel fractional Tikhonov regularization coupled with an improved super-memory gradient method and application to dynamic force identification problems
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- Convergence rate of descent method with new inexact line-search on Riemannian manifolds
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Fully implicit simulation of polymer flooding with MRST
- On obtaining optimal well rates and placement for CO\(_2\) storage
- The revised DFP algorithm without exact line search
- A globalization procedure for solving nonlinear systems of equations
- Pseudorandom lattices for global optimization
- From linear to nonlinear iterative methods
- Efficent line search algorithm for unconstrained optimization
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- Descentwise inexact proximal algorithms for smooth optimization
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- On the sufficient descent property of the Shanno's conjugate gradient method
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A two-dimensional search used with a nonlinear least-squares solver
- An efficient solution scheme for small-strain crystal-elasto-viscoplasticity in a dual framework
- Hybridization of accelerated gradient descent method
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- Implementing and modifying Broyden class updates for large scale optimization
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
- Sufficient descent Riemannian conjugate gradient methods
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- A hybrid-line-and-curve search globalization technique for inexact Newton methods
- Pseudospectral methods and iterative solvers for optimization problems from multiscale particle dynamics
- Gaussian process regression for maximum entropy distribution
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- An outlier-resistant \(\kappa\)-generalized approach for robust physical parameter estimation
- LMBOPT: a limited memory method for bound-constrained optimization
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- An active set trust-region method for bound-constrained optimization
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- A survey of gradient methods for solving nonlinear optimization
- Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Levenberg-Marquardt method for solving systems of absolute value equations
- Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Dynamic search trajectory methods for global optimization
- Some three-term conjugate gradient methods with the new direction structure
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
- Simultaneous reconstruction of the perfusion coefficient and initial temperature from time-average integral temperature measurements
- Optimization approach for the Monge-Ampère equation
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Sparse-grid, reduced-basis Bayesian inversion: nonaffine-parametric nonlinear equations
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- On efficiently combining limited-memory and trust-region techniques
- A diagonal quasi-Newton updating method for unconstrained optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Self-adaptive inexact proximal point methods
- Two descent hybrid conjugate gradient methods for optimization
- On step-size estimation of line search methods
This page was built for publication: Convergence Conditions for Ascent Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5566849)
