scientific article; zbMATH DE number 7632133

No author found.

Publication date: 12 December 2022

Full work available at URL: https://www.heldermann.de/JCA/JCA29/JCA294/jca29066.htm#jca294

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

convex optimization minimax problem maximum function compensated convex transforms tight smooth approximation

Numerical mathematical programming methods (65K05) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34) Numerical methods of relaxation type (49M20)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Smooth minimization of non-smooth functions
Gradient methods for minimizing composite functions
On solving large-scale finite minimax problems using exponential smoothing
Algorithms with adaptive smoothing for finite minimax problems
Hilbertian convex feasibility problem: Convergence of projection methods
Smoothing methods for nonsmooth, nonconvex minimization
Semi-infinite programming
Compensated convexity and its applications
Error bounds of two smoothing approximations for semi-infinite minimax problems
On the entropic regularization method for solving min-max problems with applications
Semi-infinite programming and applications to minimax problems
A class of smoothing functions for nonlinear and mixed complementarity problems
Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
Differentiability of convex envelopes
Smoothing and First Order Methods: A Unified Framework
Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Theoretical Foundations
An Algorithm for Restricted Least Squares Regression
Compensated Convexity, Multiscale Medial Axis Maps and Sharp Regularity of the Squared-Distance Function
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
A smoothing-out technique for min—max optimization
Cyclic subgradient projections
On Projection Algorithms for Solving Convex Feasibility Problems
Accurately computing the log-sum-exp and softmax functions
Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Applications to Contour Lines, Sparse Data, and Inpainting
Compensated convexity and Hausdorff stable geometric singularity extractions
Compensated convexity and Hausdorff stable extraction of intersections for smooth manifolds
Convex Analysis
Smoothing method for minimax problems

This page was built for publication: