scientific article

zbMath0621.65061MaRDI QIDQ3757284

Ladislav Lukšan

Publication date: 1986

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

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

zbMATH Keywords

convergencedual methodnonlinear minimax approximationmethod of recursive quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (2)

Separating plane algorithms for convex optimization ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• Variable metric methods for linearly constrained nonlinear minimax approximation
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints

This page was built for publication: