A numerical evaluation of some collinear scaling algorithms for unconstrained

DOI10.1080/02331939508844077zbMATH Open0821.65038OpenAlexW1992376284MaRDI QIDQ4836767FDOQ4836767

K. A. Ariyawansa, D. T. M. Lau

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844077

zbMATH Keywords

unconstrained minimizationconic approximationnumerical performancequasi-Newton algorithmscollinear scaling algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing Unconstrained Optimization Software
• Quasi-Newton Methods, Motivation and Theory
• Conic Approximations and Collinear Scalings for Optimizers
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
• Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
• The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
• Collinear scaling and sequential estimation in sparse optimization algorithms
• Quasi-newton algorithms generate identical points
• On the Convergence of the Variable Metric Algorithm
• Superlinear convergence of Broyden's boundedθ-class of methods
• Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡
• On the updating scheme in a class of collinear scaling algorithms for sparse minimization

Cited In (4)

• Title not available (Why is that?)
• A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm
• Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions
• Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡

This page was built for publication: A numerical evaluation of some collinear scaling algorithms for unconstrained

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