An augmented Lagrangian method for non-Lipschitz nonconvex programming
From MaRDI portal
Recommendations
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- A smoothing augmented Lagrangian method for nonconvex, nonsmooth constrained programs and its applications to bilevel problems
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3772411 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- A note on the complexity of \(L _{p }\) minimization
- A relaxed constant positive linear dependence constraint qualification and applications
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- An augmented Lagrangian approach for sparse principal component analysis
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic Decomposition by Basis Pursuit
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative thresholding for sparse approximations
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- Linearly constrained non-Lipschitz optimization for image restoration
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Necessary conditions for constrained optimization problems with semicontinuous and continuous data
- New results on constraint qualifications for nonlinear extremum problems and extensions
- Optimization Methods in Finance
- Penalty methods for a class of non-Lipschitz optimization problems
- Sparse Reconstruction by Separable Approximation
- Sparse and stable Markowitz portfolios
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(46)- Constrained composite optimization and augmented Lagrangian methods
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- A quadratic penalty method for hypergraph matching
- Exact augmented Lagrangian functions for nonlinear semidefinite programming
- Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
- Local properties and augmented Lagrangians in fully nonconvex composite optimization
- Zero norm based analysis model for image smoothing and reconstruction
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility
- Variational Poisson denoising via augmented Lagrangian methods
- Lifted stationary points of sparse optimization with complementarity constraints
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- On constrained optimization with nonconvex regularization
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- An augmented Lagrangian method for \(\mathrm{TV}_g +L^1\)-norm minimization
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints
- An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold
- A first-order method for nonconvex-strongly-concave constrained minimax optimization
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- A nonconvex nonsmooth image prior based on the hyperbolic tangent function
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Efficient low rank matrix recovery with flexible group sparse regularization
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- A first-order augmented Lagrangian method for constrained minimax optimization
- Sparse SVM with hard-margin loss: a Newton-augmented Lagrangian method in reduced dimensions
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- A smoothing augmented Lagrangian method for nonconvex, nonsmooth constrained programs and its applications to bilevel problems
- A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model
- An augmented Lagrangian method for training recurrent neural networks
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- An SQP-type proximal gradient method for composite optimization problems with equality constraints
- Augmented Lagrangian methods for a class of convex and nonconvex contact problems
- A nonlinear augmented Lagrangian for constrained minimax problems
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- Cardinality objective nonlinear programs for facility capacity expansion
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- A note on embeddings for the Augmented Lagrange Method
This page was built for publication: An augmented Lagrangian method for non-Lipschitz nonconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957850)
