Convergence Conditions for Ascent Methods. II: Some Corrections
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A truncated descent HS conjugate gradient method and its global convergence
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- On three-term conjugate gradient algorithms for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Convergence proof of minimization algorithms for nonconvex functions
- Convergence properties of the Beale-Powell restart algorithm
- Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization
- A robust descent type algorithm for geophysical inversion through adaptive regularization
- 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
- Smoothed _1-regularization-based line search for sparse signal recovery
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- On obtaining optimal well rates and placement for CO\(_2\) storage
- The revised DFP algorithm without exact line search
- On convergence of minimization methods: Attraction, repulsion, and selection
- From linear to nonlinear iterative methods
- 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
- Convergence of conjugate gradient methods with a closed-form stepsize formula
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems
- Sufficient descent Riemannian conjugate gradient methods
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- A hybrid-line-and-curve search globalization technique for inexact Newton methods
- Adaptive machine learning-based surrogate modeling to accelerate PDE-constrained optimization in enhanced oil recovery
- 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
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- 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
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Spectral three-term constrained conjugate gradient algorithm for function minimizations
- Dynamic search trajectory methods for global optimization
- 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
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- A diagonal quasi-Newton updating method for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Self-adaptive inexact proximal point methods
- Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process
- Convergence of nonmonotone line search method
- Some sufficient descent conjugate gradient methods and their global convergence
- Variable metric random pursuit
- A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis
- Stochastic quasi-Newton with line-search regularisation
- Constrained neural network training and its application to hyperelastic material modeling
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
- A link between the steepest descent method and fixed-point iterations
- Assimilating data on the location of the free surface of a fluid flow to determine its viscosity
- Some modified conjugate gradient methods for unconstrained optimization
- Spectral method and its application to the conjugate gradient method
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- Projection onto a polyhedron that exploits sparsity
- A subclass of generating set search with convergence to second-order stationary points
- Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method
- New conjugate gradient method for unconstrained optimization
- A new adaptive conjugate gradient algorithm for large-scale unconstrained optimization
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Studying the basin of convergence of methods for computing periodic orbits
- Optimal control of bioprocess systems using hybrid numerical optimization algorithms
- Accurate Manycore-Accelerated Manifold Surface Remesh Kernels
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
- On solving a special class of weakly nonlinear finite-difference systems
- Stochastic global optimization methods part I: Clustering methods
- Convergence and stability of line search methods for unconstrained optimization
- Two modified scaled nonlinear conjugate gradient methods
- An extension of Curry's theorem to steepest descent in normed linear spaces
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- On the use of directions of negative curvature in a modified newton method
- A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
- A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- An optimal control framework for dynamic induction control of wind farms and their interaction with the atmospheric boundary layer
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- An efficient distributed learning algorithm based on effective local functional approximations
- A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
- A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
- Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem
- A modification of classical conjugate gradient method using strong Wolfe line search
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
This page was built for publication: Convergence Conditions for Ascent Methods. II: Some Corrections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5619730)