About saddle values of a class of convex-concave functions
From MaRDI portal
Publication:4764855
DOI10.1080/02331939408843968zbMath0823.26010MaRDI QIDQ4764855
Publication date: 8 October 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408843968
convex analysis; asymptotically well-behaved functions; saddle values; convex-concave functions; approximate minimax solutions; epi/hypo-sum
26B25: Convexity of real functions of several variables, generalizations
49M99: Numerical methods in optimal control
Related Items
Cites Work
- How to regularize a difference of convex functions
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Critical Point Approximation Through Exact Regularization
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- A Parallel Algorithm for a Class of Convex Programs
- Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- Numerical methods for finding saddle points
- Convex Analysis