Variable metric methods for linearly constrained nonlinear minimax approximation

DOI10.1007/BF02242138MaRDI QIDQ1051247zbMATH OpenOpenAlexFDO

Authors Ladislav Lukšan

Publication date 1983

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02242138

zbMATH Keywords

linearly constrained optimizationnondifferentiable optimizationvariable metric methodsnonlinear minimax approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of solutions for minimax problems (49J35) Mathematical programming (90C99)

Cites work

• scientific article; zbMATH DE number 3812856 (Why is no real title available?)
• scientific article; zbMATH DE number 3727522 (Why is no real title available?)
• A numerically stable form of the simplex algorithm
• Combined lp and quasi-Newton methods for minimax optimization
• Finding the nearest point in A polytope
• Linearly constrained minimax optimization
• Newton-type methods for unconstrained and linearly constrained optimization
• Projection methods for non-linear programming
• Rank-one and Rank-two Corrections to Positive Definite Matrices Expressed in Product Form

Cited in

(4)

• scientific article; zbMATH DE number 4007605 (Why is no real title available?)
• scientific article; zbMATH DE number 3880447 (Why is no real title available?)
• scientific article; zbMATH DE number 3956831 (Why is no real title available?)
• A compact variable metric algorithm for nonlinear minimax approximation

This page was built for publication: Variable metric methods for linearly constrained nonlinear minimax approximation

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