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

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

  1. A Neural Envelope Method for Rapid Gradient-based Optimum Takeoff Trajectory Design

    Nov 17, 2026Samuel Sisk, Xiaosong DuTrajectory OptimizationNonconvex Optimization

  2. First-order smoothed exact-penalty methods for equality-constrained regularized nonconvex optimization

    Nov 15, 2026Shiji Zuo, Qihang Lin, Wei Liu +1Nonconvex OptimizationProximal Optimization

  3. Successive Convexification in Learned World Models for Safe Offline Planning

    Nov 14, 2026Samuel YoungerSafe Motion PlanningWorld Model-Based Planning

  4. ParetoM3^3: Learning on the Pareto Set under Preference Guidance via Min-Max-Min Optimization

    Nov 13, 2026Pei Tang, Songtao LuMulti-Objective OptimizationPareto Optimization

  5. Randomized and Oracle-Based Feasible Directions Methods for Nonsmooth Nonconvex Constrained Optimization

    Nov 5, 2026Dan Greenstein, Nadav HallakConstrained OptimizationNonconvex Optimization

  6. Randomized Parallel Complexity of Weakly Convex Optimization

    Nov 5, 2026Kang LiuQuery ComplexityNonconvex Optimization

  7. On the Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization with Exact Proximal Oracles

    Nov 3, 2026Yuxing Peng, Zhiqing Tang, Weijia JiaMin-Max OptimizationOracle Complexity

  8. Benign population landscapes do not transfer to empirical risk minimization in nonsmooth optimization

    Nov 1, 2026Penghao Wang, Mateo Díaz, Liwei JiangNonconvex OptimizationEmpirical Risk Minimization

  9. A knowledge-driven nonconvex square-root regularization framework for joint group sparsity and structured smoothness

    Oct 26, 2026Wanling Xie, Hu YangStructured SparsitySparse Recovery

  10. A Nonconvex Framework for Joint Sparse Sample Weighting and Parameter Estimation

    Oct 25, 2026Hassan Nojavan, Chul Moon, Miju AhnInstance ReweightingRobust Estimation

  11. Decentralized Bi-Level Optimization for Cooperative Orbital Transportation of a Rigid Payload

    Oct 22, 2026Sidhdharth D. Sikka, Revathy Ravuri, Hei Yin Jowett Chan +2Trajectory OptimizationMulti-Robot Cargo Transportation

  12. Curvature-Scaled Sharpness-Aware Minimization: Convergence Beyond Smoothness

    Oct 21, 2026Dimitris Oikonomou, Nicolas LoizouSharpness-Aware MinimizationOptimization Convergence Analysis

  13. Lower Bounds for Smooth Nonconvex Zeroth-Order Optimization: The Price of Determinism under Low Curvature Trace

    Oct 20, 2026Yuxing Peng, Zhiqing Tang, Weijia JiaZeroth-Order OptimizationNonconvex Optimization

  14. How Finite-Rank Bottlenecks Shape the Low-Rank Adaptation Landscape

    Oct 16, 2026Long Nguyen-Chi, Quynh Nguyen, Thanh Nguyen-Cung +1Low-Rank AdaptationNonconvex Optimization

  15. Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning

    Oct 15, 2026Ruixi Hu, Liang WuAlgorithmic GeneralizationGeneralization Bounds

  16. On the Optimisation Landscape of Overparameterised Weighted MMD

    Oct 14, 2026Tharrshann Jayan Logarajah, Jeremias Knoblauch, Louis SharrockOverparameterizationMaximum Mean Discrepancy

  17. Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT

    Oct 13, 2026M. Harper Langston, Pierre-David Letourneau, Dalton Jones +7Max-CutCombinatorial Optimization

  18. Learning to Design Convex Relaxations for Nonconvex Optimization

    Oct 12, 2026Jinrun Liu, Bai Yan, Tengfei Liu +5Convex RelaxationNonconvex Optimization

  19. From Parallel to Sequential: Small-Batch Noise Restores Simplicity Bias of Muon

    Oct 12, 2026Tom Jacobs, Rebekka BurkholzMuon OptimizerNonconvex Optimization

  20. Calibrated αα-Barycenters for Multiobjective ff-Divergence Optimization

    Oct 12, 2026Dier Tang, Peijie Li, Xiaoyuan ZhangMulti-Objective OptimizationSecond-Order Optimization

  21. Taming Nonconvexity with Epigraph Lifting

    Oct 12, 2026Clara Lage, Hok Shing Wong, Matthias EhrhardtNonconvex OptimizationInverse Problems

  22. Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity

    Oct 8, 2026Mingyi Li, Taira Tsuchiya, Kenji YamanishiNonconvex Stochastic OptimizationNonconvex Optimization

  23. Convex-Concave Reinforcement Learning

    Oct 6, 2026Shripad V. Deshmukh, Yaswanth Chittepu, Dhawal Gupta +2Reinforcement LearningPolicy Gradient Methods

  24. Robust Local Optimization Done Right

    Oct 5, 2026James Pritts, Kevin KöserRelative Pose EstimationNonconvex Optimization

  25. Learn Feasibility Once, Optimize All Objectives: Derivative-Free Diffusion Models for Chance-Constrained Programming

    Oct 2, 2026Ziwen Liu, Yan Liu, Congying Han +3Chance-Constrained OptimizationDiffusion Models