Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
From MaRDI portal
Publication:1897451
Some Newton and quasi-Newton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences \(\{x_k\}\) converging \(q\)-superlinearly to the solution. Furthermore, under mild assumptions, a \(q\)-quadratic convergence rate in \(x\) is also attained. Other features of these algorithms are that only the solution of linear systems of equations is required at each iteration and that the strict complementarity assumption is never invoked. First, the superlinear or quadratic convergence rate of a Newton-like algorithm is proved. Then, a simpler version of this algorithm is studied, and it is shown that it is superlinearly convergent. Finally, quasi-Newton versions of the previous algorithms are considered and, provided the sequence defined by the algorithms converges, a characterization of superlinear convergence extending the result of Boggs, Tolle, and Wang is given.
Recommendations
- scientific article; zbMATH DE number 764397
- Quasi-Newton modification of the linearization method
- A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
- Publication:3201653
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
Cites work
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of penalty functions for optimization problema with bound constraints
- A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
- A multiplier method with automatic limitation of penalty growth
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Dual Variable Metric Algorithms for Constrained Optimization
- scientific article; zbMATH DE number 4134923 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 4114401 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- New Results on a Continuously Differentiable Exact Penalty Function
- On a class fo hybrid methods for smooth constrained optimization
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Properties of updating methods for the multipliers in augmented Lagrangians
- Recursive quadratic programming methods based on the augmented lagrangian
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(65)- A penalty-function-free line search SQP method for nonlinear programming
- An improved SQP algorithm for solving minimax problems
- An SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- A new SQP method of feasible directions for nonlinear programming.
- A feasible and superlinear algorithm for inequality constrained minimization problems
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- A superlinearly convergent numerical algorithm for nonlinear programming
- An improved feasible QP-free algorithm for inequality constrained optimization
- A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics
- A decomposition method for Lasso problems with zero-sum constraint
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- A feasible SQP method for nonlinear programming
- A two-stage active-set algorithm for bound-constrained optimization
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A kind of QP-free feasible method
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- scientific article; zbMATH DE number 4151215 (Why is no real title available?)
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
- scientific article; zbMATH DE number 1880805 (Why is no real title available?)
- scientific article; zbMATH DE number 764397 (Why is no real title available?)
- An infeasible active-set QP-free algorithm for general nonlinear programming
- Total variation based community detection using a nonlinear optimization approach
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- A modified QP-free feasible method
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- Local feasible QP-free algorithms for the constrained minimization of SC^1 functions
- An active set strategy based on the multiplier function or the gradient.
- Modified active set projected spectral gradient method for bound constrained optimization
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- A nonmonotone filter method for nonlinear optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- An efficient feasible SQP algorithm for inequality constrained optimization
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A simple feasible SQP algorithm for inequality constrained optimization
- A globally and superlinearly convergent modified SQP-filter method
- Convergence rates of a multilevel method for the regularization of nonlinear ill-posed problems
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
This page was built for publication: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897451)
