An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
From MaRDI portal
Publication:2687444
DOI10.1007/s10898-022-01217-0OpenAlexW4289544461MaRDI QIDQ2687444
Publication date: 2 March 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01217-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An interior-point algorithm for nonlinear minimax problems
- A truncated aggregate smoothing Newton method for minimax problems
- Nondifferential optimization via adaptive smoothing
- An algorithm for composite nonsmooth optimization problems
- Minimax approach to structural optimization problems
- A minimax optimal control problem
- A min-max resource allocation problem with substitutions
- Minimax and applications
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- Solution of a Min-Max Vehicle Routing Problem
- The Minisum and Minimax Location Problems Revisited
- Smooth Optimization Methods for Minimax Problems
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A smoothing-out technique for min—max optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Generalized Bundle Methods
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- Smoothing method for minimax problems
This page was built for publication: An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
