Convex Function
Convex functions, characterized by possessing a single minimum, are central to optimization problems across numerous scientific fields. Current research emphasizes developing efficient algorithms for solving complex problems involving convex functions, including those arising in distributed settings, non-smooth scenarios, and those with constraints. This focus includes advancements in gradient descent methods, fractional programming techniques, and the use of convex duality to reformulate non-convex problems. The resulting improvements in computational efficiency and robustness have significant implications for applications ranging from machine learning and signal processing to robotics and power systems optimization.
Papers
October 26, 2023
October 16, 2023
October 4, 2023
September 30, 2023
September 21, 2023
September 15, 2023
July 31, 2023
June 20, 2023
June 16, 2023
June 11, 2023
June 9, 2023
June 5, 2023
May 26, 2023
May 17, 2023
April 14, 2023
March 31, 2023
January 25, 2023
December 13, 2022