scientific article

zbMath0514.65048MaRDI QIDQ3660803

Ladislav Lukšan

Publication date: 1982

Full work available at URL: https://eudml.org/doc/28526

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

numerical experimentsquasi-Newton methodslinearly constrained minimization

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Variable metric methods for linearly constrained nonlinear minimax approximation

Cites Work

• Unnamed Item
• Test examples for nonlinear programming codes
• An accelerated multiplier method for nonlinear programming
• A numerically stable form of the simplex algorithm
• Newton-type methods for unconstrained and linearly constrained optimization
• Optimally conditioned optimization algorithms without line searches
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints

This page was built for publication: