No article text was recorded for this version.
constrained non-convex optimization
Version 1 of 131 papers34 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Hessian barrier algorithms for non-convex conic optimization
- Blog: Level constrained first order methods for function constrained optimization
- Blog: A Log-Barrier Newton-CG Method for Bound Constrained Optimization with Complexity Guarantees
- Blog: Escaping from Moderately Constrained Saddles
- Blog: A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees
- Blog: Finding Second-Order Stationary Points Efficiently in Smooth Nonconvex Linearly Constrained Optimization Problems
- Blog: A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Blog: Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- Blog: Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
- Blog: Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization
- Blog: On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Minimization
- Blog: Generalized Majorization-Minimization for Non-Convex Optimization
- Blog: A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
- Blog: A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- Blog: Perturbed Proximal Descent to Escape Saddle Points for Non-convex and Non-smooth Objective Functions
- Blog: Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization
- Blog: A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization
- Blog: Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the in the O(epsilon^(-7/4)) Complexity
- Blog: Cutting plane methods can be extended into nonconvex optimization
- Blog: The computational complexity of finding stationary points in non-convex optimization
- Blog: Generalized Self-concordant Hessian-barrier algorithms
- Blog: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- Blog: Convergence error analysis of reflected gradient Langevin dynamics for non-convex constrained optimization
- Blog: A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- Blog: HOUDINI: Escaping from Moderately Constrained Saddles
- Blog: Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
- Blog: Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
- Blog: A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization
- Blog: Linearized ADMM for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
- Blog: A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization
- Blog: Barrier Algorithms for Constrained Non-Convex Optimization
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_constrained_non_convex_optimization_b3ebaba4,
title = {constrained non-convex optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constrained-non-convex-optimization/rdr_b3ebaba4d52345598e1468f4ebf67ccf},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_constrained_non_convex_optimization_b3ebaba4_v1,
title = {constrained non-convex optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constrained-non-convex-optimization/rdr_b3ebaba4d52345598e1468f4ebf67ccf/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}