An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
From MaRDI portal
Cites work
- A primal-dual hybrid gradient method for nonlinear operators with applications to MRI
- A special newton-type optimization method
- Affine recourse for the robust network design problem: between static and dynamic routing
- An algorithm for nonlinear optimization problems with binary variables
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Convex analysis and monotone operator theory in Hilbert spaces
- scientific article; zbMATH DE number 3009452 (Why is no real title available?)
- scientific article; zbMATH DE number 3894797 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Mathematical models of the delay constrained routing problem
- Multiplier and gradient methods
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- On constraint qualifications in nonsmooth optimization.
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust delay-constrained routing in telecommunications
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Über eine Aufgabe der Wahrscheinlichkeitstheorie. I, II.
Cited in
(1)
This page was built for publication: An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031033)
