An active set smoothing method for solving unconstrained minimax problems

Recommendations

An active set smoothing method for solving unconstrained minimax problem with multiple complex component functions
Active set smoothing max function based on quadratic polynomial and its application to unconstrained minimax problems
Smoothing method for minimax problems
An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
A smoothing trust-region Newton-CG method for minimax problems

Cites work

scientific article; zbMATH DE number 895357 (Why is no real title available?)
A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
A computational comparison of some non-linear programs
A cutting plane method for solving minimax problems in the complex plane
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
A smooth method for the finite minimax problem
A smoothing trust-region Newton-CG method for minimax problem
A smoothing-out technique for min—max optimization
A spline smoothing Newton method for finite minimax problems
A subgradient algorithm for certain minimax and minisum problems
A truncated aggregate smoothing Newton method for minimax problems
Acceleration of the leastpth algorithm for minimax optimization with engineering applications
Algorithms with adaptive smoothing for finite minimax problems
An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
An aggregate function method for nonlinear programming
An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
An algorithm for composite nonsmooth optimization problems
An interior-point algorithm for nonlinear minimax problems
Approximations for minimum and min-max vehicle routing problems
Benchmarking optimization software with performance profiles.
Combined lp and quasi-Newton methods for minimax optimization
Computational schemes for large-scale problems in extended linear- quadratic programming
Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
General programmes for least pth and near minimax approximation
Generalized Bundle Methods
Linear-Quadratic Programming and Optimal Control
Minimax approach to structural optimization problems
Nondifferential optimization via adaptive smoothing
Primal interior-point method for large sparse minimax optimization
Smooth Optimization Methods for Minimax Problems
Smoothing method for minimax problems
Solution of a min-max vehicle routing problem
Solution of monotone complementarity problems with locally Lipschitzian functions
Superlinearly convergent algorithm for min-max problems
The Minimax Solution of an Overdetermined System of Non-linear Equations

Cited in

(8)

A first-order smoothing method for minimizing the sum of the $r$-largest functions
A smooth method for solving non-smooth unconstrained optimization problems
A perturbed SQP method with active set technology for unconstrained minimax problems
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
Active-set Methods for Submodular Minimization Problems
An active set smoothing method for solving unconstrained minimax problem with multiple complex component functions
Active set smoothing max function based on quadratic polynomial and its application to unconstrained minimax problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779576)