A proximal-gradient method for equality constrained optimization
From MaRDI portal
nonconvex optimizationsequential quadratic programmingnonlinear optimizationworst-case iteration complexityregularization methodssequential quadratic optimization
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Abstract computational complexity for mathematical programming problems (90C60)
Cites work
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Penalty Function Method Converging Directly to a Constrained Optimum
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- A first order, exact penalty function algorithm for equality constrained optimization problems
- A globally convergent method for nonlinear programming
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
- A reduced-space algorithm for minimizing _1-regularized convex functions
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A second derivative SQP method: global convergence
- A second derivative SQP method: local convergence and practical issues
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization
- An SQP-type proximal gradient method for composite optimization problems with equality constraints
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- An interior proximal gradient method for nonconvex optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Constrained composite optimization and augmented Lagrangian methods
- Exact penalty functions in nonlinear programming
- FarRSA for \(\ell_1\)-regularized convex optimization: local convergence and numerical experience
- First-order methods in optimization
- Inexact successive quadratic approximation for regularized optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Primal-dual active-set methods for large-scale optimization
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Scalable nonlinear programming via exact differentiable penalty functions and trust-region Newton methods
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Trust Region Methods
This page was built for publication: A proximal-gradient method for equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877527)
