Globally convergent algorithms for solving unconstrained optimization problems

DOI10.1080/02331934.2012.745529MaRDI QIDQ4981855zbMATH OpenOpenAlexFDO

Authors Sattar Seifollahi, Sona Taheri, Musa Mammadov

Publication date 20 March 2015

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60698

zbMATH Keywords

global convergencegradient methodNewton methodquasi-Newton methodsuperlinear convergenceunconstrained optimization

Mathematics Subject Classification ID

Newton-type methods (49M15) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Recommendations

• Globally convergent algorithms for unconstrained optimization
• An algorithm for unconstrained optimization
• scientific article; zbMATH DE number 88930
• New conjugate gradient method for unconstrained optimization
• A new hybrid conjugate gradient algorithm for unconstrained optimization

Cites work

• A combined conjugate-gradient quasi-Newton minimization algorithm
• A globalization procedure for solving nonlinear systems of equations
• A modified Newton method with cubic convergence: the multivariate case
• A semismooth equation approach to the solution of nonlinear complementarity problems
• A third-order modification of Newton method for systems of non-linear equations
• Extending the relationship between the conjugate gradient and BFGS algorithms
• Globally convergent algorithms for unconstrained optimization
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• Improved Newton's method without direct function evaluations
• Modified quasi-Newton methods for solving systems of linear equations
• Newton-conjugate-gradient methods for solitary wave computations
• Testing Unconstrained Optimization Software

Cited in

(15)

• Convergent outer approximation algorithms for solving unary programs
• A framework for globally convergent algorithms using gradient bounding functions
• Globally convergent algorithms for unconstrained optimization
• Triality theory for general unconstrained global optimization problems
• Optimal algorithms and the BFGS updating techniques for solving unconstrained nonlinear minimization problems
• Extended global convergence framework for unconstrained optimization
• General viscosity iterative approximation for solving unconstrained convex optimization problems
• Globally convergent algorithms for semidefinite complementarity problems
• scientific article; zbMATH DE number 3913569 (Why is no real title available?)
• Global convergence of a multidirectional algorithm for unconstrained optimal control problems
• Globally convergent block-coordinate techniques for unconstrained optimization
• Learning the naive Bayes classifier with optimization models
• Solving constrained global optimization problems without penalty parameters
• An inexact Newton-Lanczos method for solving a system of nonlinear equations
• Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization

This page was built for publication: Globally convergent algorithms for solving unconstrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981855)