An active set smoothing method for solving unconstrained minimax problems

DOI10.1155/2020/9108150zbMath1459.90221OpenAlexW3037911663MaRDI QIDQ779576

Publication date: 13 July 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9108150

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)

Cites Work

Unnamed Item
Unnamed Item
A spline smoothing Newton method for finite minimax problems
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
A cutting plane method for solving minimax problems in the complex plane
An aggregate function method for nonlinear programming
Minimax approach to structural optimization problems
Solution of monotone complementarity problems with locally Lipschitzian functions
Computational schemes for large-scale problems in extended linear- quadratic programming
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
Superlinearly convergent algorithm for min-max problems
Solution of a Min-Max Vehicle Routing Problem
Smooth Optimization Methods for Minimax Problems
Acceleration of the leastpth algorithm for minimax optimization with engineering applications
Combined lp and quasi-Newton methods for minimax optimization
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
A subgradient algorithm for certain minimax and minisum problems
An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
The Minimax Solution of an Overdetermined System of Non-linear Equations
Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
Linear-Quadratic Programming and Optimal Control
General programmes for least pth and near minimax approximation
Generalized Bundle Methods
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
Approximations for minimum and min-max vehicle routing problems
A computational comparison of some non-linear programs
Smoothing method for minimax problems
Benchmarking optimization software with performance profiles.

This page was built for publication: An active set smoothing method for solving unconstrained minimax problems