Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- A lower bound for the controlling parameters of the exact penalty functions
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- A proximal modified quasi-Newton method for nonsmooth regularized optimization
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Algorithms for nonlinear constraints that use lagrangian functions
- An Exact Potential Method for Constrained Maxima
- An interior-point \(\ell_1\)-penalty method for nonlinear optimization
- Approximating minimum norm solutions of rank-deficient least squares problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Computing a Trust Region Step
- Convex Analysis
- Exact penalty functions in nonlinear programming
- Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
- Implementing a smooth exact penalty function for general constrained nonlinear optimization
- Julia: a fresh approach to numerical computing
- Large-scale linearly constrained optimization
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- Multiplier and gradient methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained 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
- Practical augmented Lagrangian methods for constrained optimization
- Proximal Newton-type methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Second-order conditions for an exact penalty function
- Second-order necessary and sufficient conditions in nonsmooth optimization
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Sufficient conditions for a globally exact penalty function without convexity
- The ESA NLP solver WORHP
- Trust Region Methods
- Variational Analysis
This page was built for publication: Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230412)
