Gradient-type methods: a unified perspective in computer science and numerical analysis

DOI10.5402/2011/715748zbMath1238.65054OpenAlexW2038361810WikidataQ58689535 ScholiaQ58689535MaRDI QIDQ420252

Stefano Fanelli

Publication date: 21 May 2012

Published in: ISRN Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5402/2011/715748

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• TT-cross approximation for multidimensional arrays
• A new algorithm for box-constrained global optimization
• A new polynomial-time algorithm for linear programming
• A unifying approach to the construction of circulant preconditioners
• Conical projection algorithms for linear programming
• Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
• Primal-relaxed dual global optimization approach
• Matrix algebras in quasi-Newton methods for unconstrained minimization
• Incomplete cross approximation in the mosaic-skeleton method
• A continuous approach to nonlinear integer programming
• Hartley-type algebras in displacement and optimization strategies.
• Deterministic global optimization. Theory, methods and applications
• A finite steps algorithm for solving convex feasibility problems
• Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Low‐complexity minimization algorithms
• Numerical Optimization
• Global Continuation for Distance Geometry Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Interior Methods for Nonlinear Optimization
• Semidefinite Programming

This page was built for publication: Gradient-type methods: a unified perspective in computer science and numerical analysis