On max-\(k\)-sums

DOI10.1007/s10107-017-1201-0zbMath1397.90302OpenAlexW2765469756MaRDI QIDQ1785208

Michael J. Todd

Publication date: 28 September 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1201-0

zbMATH Keywords

complexitysmoothingpartially orderedpointwise maximummax-\(k\)-sums

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Convex programming (90C25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Self-concordant barriers for convex approximations of structured convex sets
• Monotone functions on formally real Jordan algebras
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Introductory lectures on convex optimization. A basic course.
• Optimization of demand response through peak shaving
• Über monotone Matrixfunktionen
• The maximum concurrent flow problem
• An Alternate Approach to Alternating Sums: A Method to DIE for
• Convex Analysis
• A Class of Exponential Penalty Functions

This page was built for publication: On max-\(k\)-sums