Solution methodologies for minimizing a sum of pointwise minima of two functions

DOI10.1007/S11590-022-01866-WMaRDI QIDQ2679000zbMATH OpenOpenAlexFDO

Authors Xinyi Zuo, Yi Jiang

Publication date 18 January 2023

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-022-01866-w

zbMATH Keywords

ADMM algorithmDC algorithmsmooth approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Solution of minimax problems using equivalent differentiable functions
• scientific article; zbMATH DE number 2221954
• A method for minimizing the sum of a convex function and a continuously differentiable function
• Minimization of the sum of minima of convex functions and its application to clustering
• On the solution of min-sum-min problems

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• An e-E-insensitive support vector regression machine
• Analysis of multi-stage convex relaxation for sparse regularization
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
• DC programming and DCA: thirty years of developments
• Efficient and Robust Image Restoration Using Multiple-Feature L2-Relaxed Sparse Analysis Priors
• Learning sparse classifiers with difference of convex functions algorithms
• Minimizing Sum of Truncated Convex Functions and Its Applications
• Minimizing a sum of clipped convex functions
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Outlier detection and robust mixture modeling using nonconvex penalized likelihood
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Robust Statistics
• Robust Truncated Hinge Loss Support Vector Machines
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems
• Thresholding implied by truncated quadratic regularization
• Translating a convex polygon to contain a maximum number of points.

Cited in

(1)

• Minimizing a sum of clipped convex functions

Describes a project that uses

Uses Software

• sccf

This page was built for publication: Solution methodologies for minimizing a sum of pointwise minima of two functions

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