Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach

Xiaohan Wei, Hao Yu, Qing Ling, Michael Neely

Feb-19-2026, 14:53:47 GMT–Neural Information Processing Systems

Neural Information Processing Systems http://nips.cc/

algorithm, convergence time, dual function, (12 more...)

Neural Information Processing Systems

Feb-19-2026, 14:53:47 GMT

Conferences PDF

Country:
- North America
  - United States
    - Washington > King County
      - Bellevue (0.04)
    - California > Los Angeles County
      - Los Angeles (0.14)
      - Santa Monica (0.04)
  - Canada > Quebec
    - Montreal (0.04)
- Asia
  - Middle East > Jordan (0.04)
  - China > Guangdong Province
    - Guangzhou (0.04)

Technology:
- Information Technology
  - Communications > Networks (0.93)
  - Artificial Intelligence
    - Machine Learning (1.00)
    - Representation & Reasoning > Optimization (0.94)

Duplicate Docs Excel Report

Title
Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach
Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach

Similar Docs Excel Report more

Title	Similarity	Source
None found