Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
From MaRDI portal
Recommendations
- Semi-proximal point method for nonsmooth convex-concave minimax optimization
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- A new algorithm for minimax andl1-norm optimization
- A hybrid algorithm for linearly constrained minimax problems
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A generalized Newton method for absolute value equations
- A geometric property of the least squares solution of linear equations
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A primal-dual hybrid gradient method for nonlinear operators with applications to MRI
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Absolute value equations
- Absolute value programming
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
- An introduction to continuous optimization for imaging
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Augmented _1 and nuclear-norm models with a globally linearly convergent algorithm
- Copositive-plus Lemke algorithm solves polymatrix games
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Equivalence of hybrid dynamical models
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Fixed point theory and applications
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- Linear complementarity as absolute value equation solution
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Method of alternating projections for the general absolute value equation
- Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
- Modified Newton-type iteration methods for generalized absolute value equations
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- Newton-based matrix splitting method for generalized absolute value equation
- On generalized absolute value equations
- On LICQ and the uniqueness of Lagrange multipliers
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the number of iterations of Karmarkar's algorithm for linear programming
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Optimal primal-dual methods for a class of saddle point problems
- Optimization approach to Berge equilibrium for bimatrix game
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Semi-proximal point method for nonsmooth convex-concave minimax optimization
- Smooth minimization of non-smooth functions
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- The Linear Complementarity Problem
- The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints
Cited in
(7)- Convergence properties of gradient-based methods for minimax problems with nonlinear constraints
- Asymptotic behavior of penalty dynamics for constrained variational inequalities
- A first-order method for nonconvex-strongly-concave constrained minimax optimization
- Solutions for underdetermined generalized absolute value equations
- A first-order augmented Lagrangian method for constrained minimax optimization
- A new smoothing Newton-type two-step algorithm to solve non-Lipschitz absolute value equations of the form \(Ax + B|x|^p = b\)
- A generalization of the Gauss-Seidel iteration method for generalized absolute value equations
This page was built for publication: Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601202)
