A new algorithm for minimax andl1-norm optimization

DOI10.1080/02331939808844412zbMath0954.49021OpenAlexW2045502802MaRDI QIDQ4944416

S. V. Prischepova, Ekaterina Kostina

Publication date: 29 January 2001

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844412

zbMATH Keywords

optimality conditionsnonlinear programmingminimax finite-dimensional norm optimizationnonsmooth and smooth support

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Robustness Aspects in Parameter Estimation, Optimal Design of Experiments and Optimal Control

Cites Work

• Nonlinear programming using minimax techniques
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• An Efficient Method to Solve the Minimax Problem Directly
• Robust Statistics
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for minimax andl₁-norm optimization