scientific article; zbMATH DE number 7632133
From MaRDI portal
Publication:5055095
compensated convex transformsconvex optimizationmaximum functionminimax problemtight smooth approximation
Numerical methods of relaxation type (49M20) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Semi-infinite programming (90C34) Minimax problems in mathematical programming (90C47)
Recommendations
Cites work
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A smoothing-out technique for min—max optimization
- Accurately computing the log-sum-exp and softmax functions
- Algorithms with adaptive smoothing for finite minimax problems
- Alternating projection methods.
- An Algorithm for Restricted Least Squares Regression
- Compensated convexity and Hausdorff stable extraction of intersections for smooth manifolds
- Compensated convexity and Hausdorff stable geometric singularity extractions
- Compensated convexity and its applications
- Compensated convexity methods for approximations and interpolations of sampled functions in Euclidean spaces: applications to contour lines, sparse data, and inpainting
- Compensated convexity methods for approximations and interpolations of sampled functions in Euclidean spaces: theoretical foundations
- Compensated Convexity, Multiscale Medial Axis Maps and Sharp Regularity of the Squared-Distance Function
- Convex Analysis
- Convex analysis based smooth approximations of maximum functions and squared-distance functions
- Cyclic subgradient projections
- Differentiability of convex envelopes
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- Gradient methods for minimizing composite functions
- Hilbertian convex feasibility problem: Convergence of projection methods
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- Introduction to algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On solving large-scale finite minimax problems using exponential smoothing
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- On the entropic regularization method for solving min-max problems with applications
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Semi-infinite programming
- Semi-infinite programming and applications to minimax problems
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Smoothing method for minimax problems
- Smoothing methods for nonsmooth, nonconvex minimization
Cited in
(12)- Approximate maxima finding of continuous functions under restricted budget
- The optimal strategies for the search of a maximum for the functions of the class \(W_ 1^ r\)
- On max-k-sums
- Some properties of a smoothing approximation for maximum function
- Convex analysis based smooth approximations of maximum functions and squared-distance functions
- On logarithmic smoothing of the maximum function
- Max-convolution through numerics and tropical geometry
- Uniform approximation of min/max functions by smooth splines
- On the modulus of Lipschitz smoothness of log-sum-exp function
- Segmenting objects with imbalanced sizes via smooth and sparse dual optimal transport
- The maximum-norm of the restricted denominator approximations
- Compensated convexity and its applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055095)
