A QP-free algorithm for finite minimax problems

DOI10.1155/2014/436415zbMath1470.90155OpenAlexW2141448280WikidataQ59038239 ScholiaQ59038239MaRDI QIDQ1724124

Qinfeng Zhang, Dao Lan Han, Jin-Bao Jian

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/436415

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• Unnamed Item
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• On smooth reformulations and direct non-smooth computations for minimax problems
• Inexact smoothing method for large scale minimax optimization
• On solving large-scale finite minimax problems using exponential smoothing
• Algorithms with adaptive smoothing for finite minimax problems
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
• Nonmonotone algorithm for minimax optimization problems
• A modified SQP algorithm for minimax problems
• An interior-point algorithm for nonlinear minimax problems
• An improved SQP algorithm for solving minimax problems
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
• New minimax algorithm
• Nonmonotone line search algorithm for constrained minimax problems
• Convergence of an interior point algorithm for continuous minimax
• Superlinearly convergent algorithm for min-max problems
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems
• An interior point algorithm for continuous minimax: implementation and computation
• Variable metric methods for minimizing a class of nondifferentiable functions
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• An Efficient Method to Solve the Minimax Problem Directly
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems
• On logarithmic smoothing of the maximum function
• Smoothing method for minimax problems

This page was built for publication: A QP-free algorithm for finite minimax problems