scientific article

zbMath0552.90074MaRDI QIDQ3346095

Ladislav Lukšan

Publication date: 1984

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

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

zbMATH Keywords

algorithmconvergencedual methodslinearly constrained nonlinear minimax approximation

Mathematics Subject Classification ID

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

Related Items

Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Unnamed Item, Clusterwise support vector linear regression, An augmented subgradient method for minimizing nonsmooth DC functions, Diagonal bundle method for nonsmooth sparse optimization, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, A bundle-filter method for nonsmooth convex constrained optimization, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, Unnamed Item, Subgradient and Bundle Methods for Nonsmooth Optimization, A bundle-Newton method for nonsmooth unconstrained minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable metric methods for linearly constrained nonlinear minimax approximation
• Variable metric methods for minimizing a class of nondifferentiable functions
• Finding the nearest point in A polytope
• Linearly constrained minimax optimization
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints