Variable metric methods for linearly constrained nonlinear minimax approximation
type: Item
instance of: scholarly article
title: Variable metric methods for linearly constrained nonlinear minimax approximation
zbMATH Open document ID: 0514.49016
DOI: 10.1007/BF02242138
published in: Computing
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 49J35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3812369
zbMATH Keywords: linearly constrained optimization
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: nonlinear minimax approximation
zbMATH Keywords: variable metric methods
author: Ladislav Lukšan
MaRDI profile type: Publication
cites work: Rank-one and Rank-two Corrections to Positive Definite Matrices Expressed in Product Form
cites work: A numerically stable form of the simplex algorithm
cites work: Newton-type methods for unconstrained and linearly constrained optimization
cites work: Combined lp and quasi-Newton methods for minimax optimization
cites work: Q3660803
cites work: Linearly constrained minimax optimization
cites work: Q3915936
cites work: Projection methods for non-linear programming
cites work: Finding the nearest point in A polytope
full work available at URL: https://doi.org/10.1007/bf02242138
OpenAlex ID: W406762770
description: scientific article; zbMATH DE number 3812369