Pages that link to "Item:Q5566849"
From MaRDI portal
The following pages link to Convergence Conditions for Ascent Methods (Q5566849):
Displaying 50 items.
- On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
- A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
- Variable metric random pursuit (Q263217) (← links)
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
- Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- Shape optimization of continua using NURBS as basis functions (Q381943) (← links)
- Shape optimization for a link mechanism (Q382032) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- Convergence and stability of line search methods for unconstrained optimization (Q385584) (← links)
- New cautious BFGS algorithm based on modified Armijo-type line search (Q385833) (← links)
- A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
- Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
- A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei (Q453599) (← links)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence (Q499680) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration (Q537640) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- A new algorithm for box-constrained global optimization (Q639210) (← links)
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems (Q654620) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- Analysis of a self-scaling quasi-Newton method (Q689143) (← links)
- Scaled memoryless symmetric rank one method for large-scale optimization (Q720629) (← links)
- Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
- A new three-term conjugate gradient method (Q761255) (← links)
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming (Q797502) (← links)
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming (Q800833) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- A constrained optimization approach to solving certain systems of convex equations (Q853007) (← links)
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods (Q856066) (← links)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
- Global convergence properties of two modified BFGS-type methods (Q874351) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q878996) (← links)
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
