An active set smoothing method for solving unconstrained minimax problems
From MaRDI portal
Publication:779576
DOI10.1155/2020/9108150zbMATH Open1459.90221OpenAlexW3037911663MaRDI QIDQ779576FDOQ779576
Authors: Zhengyong Zhou, Qi Yang 
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
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)
Cites Work
- Benchmarking optimization software with performance profiles.
- Smooth Optimization Methods for Minimax Problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Generalized Bundle Methods
- An aggregate function method for nonlinear programming
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Nondifferential optimization via adaptive smoothing
- Minimax approach to structural optimization problems
- Algorithms with adaptive smoothing for finite minimax problems
- A smoothing-out technique for min—max optimization
- Solution of a min-max vehicle routing problem
- Smoothing method for minimax problems
- Approximations for minimum and min-max vehicle routing problems
- Superlinearly convergent algorithm for min-max problems
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- A smooth method for the finite minimax problem
- Primal interior-point method for large sparse minimax optimization
- Title not available (Why is that?)
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- 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 computational comparison of some non-linear programs
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- A subgradient algorithm for certain minimax and minisum problems
- A cutting plane method for solving minimax problems in the complex plane
- Linear-Quadratic Programming and Optimal Control
- An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
- A truncated aggregate smoothing Newton method for minimax problems
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- An algorithm for composite nonsmooth optimization problems
- A spline smoothing Newton method for finite minimax problems
- Combined lp and quasi-Newton methods for minimax optimization
- Computational schemes for large-scale problems in extended linear- quadratic programming
- General programmes for least pth and near minimax approximation
Cited In (8)
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Active-set Methods for Submodular Minimization Problems
- A perturbed SQP method with active set technology for unconstrained minimax problems
- Active set smoothing max function based on quadratic polynomial and its application to unconstrained minimax problems
- A first-order smoothing method for minimizing the sum of the \(r\)-largest functions
- A smooth method for solving non-smooth unconstrained optimization problems
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- An active set smoothing method for solving unconstrained minimax problem with multiple complex component functions
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)
