Overview

Nonconvex optimization studies how to find useful solutions when objectives may have many local minima, saddle points, or irregular regions, as in deep learning, matrix recovery, control, and clustering. Common approaches include gradient and stochastic-gradient methods, proximal and difference-of-convex algorithms, alternating and coordinate updates, and manifold-aware methods; global search and convex relaxations are used when stronger guarantees are needed. Theory often measures progress through stationarity and analyzes convergence rates under assumptions such as smoothness, weak convexity, or gradient domination, while benchmarks test performance on large-scale and application-specific problems. A central tension is that efficient methods can often guarantee a stationary point, but proving global optimality or escaping poor solutions may require stronger assumptions, more computation, or problem-specific structure.

Latest papers

CardsList

164 papers15 papers in the last four weeks, down 32% on the four weeks before. 0.1% of all new papers.

  1. Disciplined Biconvex Programming

    Nov 3, 2025Hao Zhu, Joschka BoedeckerNonconvex OptimizationConstrained Optimization

  2. The Optimization Landscape of Carathéodory Decomposition of Toeplitz Covariances

    Nov 3, 2025Daniel Busbib, Ami WieselNonconvex OptimizationMatrix Optimization

  3. Stochastic Difference-of-Convex Optimization with Momentum

    Oct 20, 2025El Mahdi Chayti, Martin JaggiNonconvex OptimizationNonconvex Stochastic Optimization

  4. Smooth Quasar-Convex Optimization with Constraints

    Oct 2, 2025David Martínez-RubioRiemannian OptimizationNonconvex Optimization

  5. Convergence Analysis of the ProbAbilistic Gradient Estimator Algorithm for Weakly Convex Finite-Sum Optimization

    Aug 31, 2025Laurent Condat, Peter RichtárikStochastic OptimizationNonconvex Stochastic Optimization

  6. Douglas-Rachford Splitting for Group-Sparse Feedback Linear-Quadratic Control

    Jul 26, 2025Lechen Feng, Xun Li, Yuan-Hua NiDistributed OptimizationDistributed Control

  7. Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions

    Jul 25, 2025Zhe Zhang, Suvrit SraNonsmooth Convex OptimizationNonconvex Optimization

  8. Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles

    Apr 4, 2025Guneykan Ozgul, Xiantao Li, Mehrdad Mahdavi +1Markov Chain Monte CarloStochastic Gradient Langevin Dynamics

  9. Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes

    Dec 18, 2024Guanghui Lan, Tianjiao Li, Yangyang XuGradient ProjectionNonconvex Optimization

  10. Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum

    Jun 18, 2024Haoyuan Cai, Sulaiman A. Alghunaim, Ali H. SayedMomentum MethodsNonconvex Stochastic Optimization

  11. Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima

    Jul 13, 2023Rishabh Dixit, Mert Gurbuzbalaban, Waheed U. BajwaNonconvex OptimizationAccelerated Gradient Methods

  12. Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation

    Jun 7, 2023Zhao Song, Mingquan Ye, Junze Yin +1Alternating MinimizationLow-Rank Approximation

  13. Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time

    Feb 21, 2023Yuzhou Gu, Zhao Song, Junze Yin +1Alternating MinimizationMatrix Completion