atlas

Research map / Optimization / Nonconvex and smooth optimization

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

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use multi-stage homotopy smoothing under a local error boundLinearly constrained convex programs · Linearly constrained convex programs with a local error boundprimal convergence time: O(1/\varepsilon) -> O\left(\varepsilon^{-2/(2+\beta)}\log_2(\varepsilon^{-1})\right)Helped
Apply the method when the dual function is non-smooth but locally quadratic (β=1/2)Primal-dual homotopy smoothing · Distributed geometric medianconvergence time: \mathcal{O}\left(1/\varepsilon\right) -> \mathcal O\left(\varepsilon^{-4/5}\log_2(\varepsilon^{-1})\right)Helped
Compare the proposed algorithm with existing algorithms in simulationsDistributed geometric median · Random networks with n=20, 50, 100relative errorMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy