Convergence Conditions for Ascent Methods

Cited in

(only showing first 100 items - show all)

New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
On quasi-Newton methods in fast Fourier transform-based micromechanics
A class of gradient unconstrained minimization algorithms with adaptive stepsize
Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization
A note on the Morozov principle via Lagrange duality
Convergence of PRP method with new nonmonotone line search
An efficient solution scheme for small-strain crystal-elasto-viscoplasticity in a dual framework
Swarm-based optimization with random descent
A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
Numerically stable computation of step-sizes for descent methods. The nonconvex case
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities
An adaptive scaled BFGS method for unconstrained optimization
The hybrid BFGS-CG method in solving unconstrained optimization problems
Hybrid Riemannian conjugate gradient methods with global convergence properties
The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations
Variable metric random pursuit
Pseudospectral methods and iterative solvers for optimization problems from multiscale particle dynamics
Modified nonmonotone Armijo line search for descent method
Spectral method and its application to the conjugate gradient method
On solving a special class of weakly nonlinear finite-difference systems
Sufficient descent Riemannian conjugate gradient methods
New hybrid conjugate gradient method as a convex combination of LS and CD methods
Shape optimization of continua using NURBS as basis functions
A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems
Generalized RMIL conjugate gradient method under the strong Wolfe line search with application in image processing
Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
Wasserstein-penalized entropy closure: a use case for stochastic particle methods
Convergence rate of descent method with new inexact line-search on Riemannian manifolds
New hyrid conjugate gradient method as a convex combination of HZ and CD methods
Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
An improvement of the Goldstein line search
Descent methods for composite nondifferentiable optimization problems
Convergence of quasi-Newton method with new inexact line search
A NUMERICAL STUDY OF CONJUGATE GRADIENT DIRECTIONS FOR AN ULTRASOUND INVERSE PROBLEM
Influence to new formulas gradient for removing impulse noise images
An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
A spectral Hestenes-Stiefel CG algorithm for large-scale unconstrained optimization in image restoration problems
Physically enhanced training for modeling rate-independent plasticity with feedforward neural networks
Accelerating the convergence of Newton's method for nonlinear elliptic PDEs using Fourier neural operators
Convergence of implementable descent algorithms for unconstrained optimization
A new diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
A sufficient descent Liu–Storey conjugate gradient method and its global convergence
Convergence properties of the Beale-Powell restart algorithm
An efficient three-dimensional mesh quality optimization method based on gradient-enhanced probabilistic model
Cubic regularization in symmetric rank-1 quasi-Newton methods
A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
An improved PRP conjugate gradient algorithm with a damping factor within an automatic restarting strategy
Stochastic three-term conjugate gradient method with variance technique for non-convex learning
Another modified version of RMIL conjugate gradient method
Global convergence of conjugate gradient method
Recent advances in unconstrained optimization
A double parameter scaled BFGS method for unconstrained optimization
Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods
Modifying the BFGS update by a new column scaling technique
A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
A robust BFGS algorithm for unconstrained nonlinear optimization problems
Some modified conjugate gradient methods for unconstrained optimization
A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks
A new hybrid conjugate gradient method of unconstrained optimization methods
Stochastic quasi-Newton with line-search regularisation
A revised MRMIL Riemannian conjugate gradient method with simplified global convergence properties
Efficent line search algorithm for unconstrained optimization
A new algorithm for box-constrained global optimization
Projection onto a polyhedron that exploits sparsity
Direct energy minimization based on exponential transformation in density functional calculations of finite and extended systems
Computer Algebra and Line Search
Gaussian process regression for maximum entropy distribution
Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization
Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems
Scaled memoryless symmetric rank one method for large-scale optimization
Pure strategy Nash equilibria for bargaining models of collective choice
Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
A constrained optimization approach to solving certain systems of convex equations
Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
Comments on ”New hybrid conjugate gradient method as a convex combination of FR and PRP methods”
Useful redundancy in parameter and time delay estimation for continuous-time models
Robust regression against heavy heterogeneous contamination
On the estimation of destructive cure rate model: A new study with exponentially weighted Poisson competing risks
New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
On Conjugate Gradient Algorithms as Objects of Scientific Study
Globally convergent inexact generalized Newton method for first-order differentiable optimization problems
Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
An explicit spectral Fletcher-Reeves conjugate gradient method for bi-criteria 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 adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
Descentwise inexact proximal algorithms for smooth optimization
Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
Practical convergence conditions for unconstrained optimization
An efficient distributed learning algorithm based on effective local functional approximations
Some three-term conjugate gradient methods with the inexact line search condition
A spectral KRMI conjugate gradient method under the strong-Wolfe line search
Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection

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)