Proximal subgradient method for non-Lipschitz objective functions

DOI10.1080/10556788.2025.2475405MaRDI QIDQ6907540zbMATH OpenFDO

Authors Mitsuru Toyoda, Mirai Tanaka

Publication date 1 November 2025

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2025.2475405

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods involving semicontinuity and convergence; relaxation (49J45)

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 1001723 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
• Convex optimization: algorithms and complexity
• Discrete-Valued Control of Linear Time-Invariant Systems by Sum-of-Absolute-Values Optimization
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
• First-order methods in optimization
• Geometric median in nearly linear time
• Gradient methods for minimizing composite functions
• Introduction to nonsmooth optimization. Theory, practice and software
• Iterative minimization of \(H_2\) control performance criteria
• Lectures on convex optimization
• Local strong convexity and local Lipschitz continuity of the gradient of convex functions
• Model Selection and Estimation in Regression with Grouped Variables
• Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon
• On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
• Ridge Regression: Biased Estimation for Nonorthogonal Problems
• Solving basis pursuit: heuristic optimality check and solver comparison
• Solving variational inequalities with stochastic mirror-prox algorithm
• Sparse Packetized Predictive Control for Networked Control Over Erasure Channels
• Sparse and constrained stochastic predictive control for networked systems
• Stability analysis of a class of sparse optimization problems

This page was built for publication: Proximal subgradient method for non-Lipschitz objective functions

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