Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
From MaRDI portal
Cites work
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence
- Comments on: ``Wavelets in statistics: a review by A. Antoniadis
- Complexity and performance of an augmented Lagrangian algorithm
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence rate estimates for penalty methods revisited
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Nearly unbiased variable selection under minimax concave penalty
- On the complexity of an inexact restoration method for constrained optimization
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Practical augmented Lagrangian methods for constrained optimization
- Preface
- Survey of sequential convex programming and generalized Gauss-Newton methods
- The method of penalty estimates for conditional extremum problems
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Variational methods for the solution of problems of equilibrium and vibrations
This page was built for publication: Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008133)
