A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization

Cited in

(42)

A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
A min-max algorithm for non-linear regression models
An algorithm for composite nonsmooth optimization problems
A compact variable metric algorithm for nonlinear minimax approximation
Back-averaging: An accelerated iterative method for simulating plasma diffusion
A superlinearly convergent constrained min-max algorithm for rival models of the same system
A constrained min-max algorithm for rival models of the same economic system
A barrier function method for minimax problems
A projected conjugate gradient method for sparse minimax problems
Nonmonotone line search for minimax problems
Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control
Corrected sequential linear programming for sparse minimax optimization
Robust min-max portfolio strategies for rival forecast and risk scenarios
Approximation in normed linear spaces
On solving three classes of nonlinear programming problems via simple differentiable penalty functions
A hybrid algorithm for nonlinear minimax problems
Superlinearly convergent algorithm for min-max problems
A smoothing iterative method for the finite minimax problem
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Quadratically constraint quadratical algorithm model for nonlinear minimax problems
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
Form assessment in coordinate metrology
A note on the computation of an orthonormal basis for the null space of a matrix
A hybrid algorithm for linearly constrained minimax problems
Local properties of algorithms for minimizing nonsmooth composite functions
A projected lagrangian algorithm for semi-infinite programming
On the superlinear convergence of a trust region algorithm for nonsmooth optimization
Local properties of inexact methods for minimizing nonsmooth composite functions
Substitution secant/finite difference method to large sparse minimax problems
A design of experiment approach to the selection of CMM form-fitting algorithms
A new algorithm for minimax andl₁-norm optimization
A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
A new non-monotone SQP algorithm for the minimax problem
A spline smoothing Newton method for finite minimax problems
Alternating projection method for sparse model updating problems
Algorithms with adaptive smoothing for finite minimax problems
On the relationship between the pole condition, absorbing boundary conditions, and perfectly matched layers
An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
An active set smoothing method for solving unconstrained minimax problems
A note on solving nonlinear minimax problems via a differentiable penalty function
An -active barrier-function method for solving minimax problems
A truncated aggregate smoothing Newton method for minimax problems

This page was built for publication: A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization

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