Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems

DOI10.1007/BF02192227zbMath0830.90125MaRDI QIDQ1897451

Francisco Facchinei, Stefano Lucidi

Publication date: 9 October 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

strict complementarityquadratic convergencesuperlinear convergencequasi-Newton algorithmsmultiplier functionsinequality constrained minimization problems

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, A two-stage active-set algorithm for bound-constrained optimization, A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity, A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity, A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, An efficient feasible SQP algorithm for inequality constrained optimization, An augmented Lagrangian method exploiting an active-set strategy and second-order information, A truncated Newton method in an augmented Lagrangian framework for nonlinear programming, 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, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, A simple feasible SQP algorithm for inequality constrained optimization, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, A superlinearly convergent numerical algorithm for nonlinear programming, An active set strategy based on the multiplier function or the gradient., An improved feasible QP-free algorithm for inequality constrained optimization, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, Modified active set projected spectral gradient method for bound constrained optimization, A new SQP method of feasible directions for nonlinear programming., A working set SQCQP algorithm with simple nonmonotone penalty parameters, A globally and superlinearly convergent modified SQP-filter method, An exact penalty-Lagrangian approach for large-scale nonlinear programming, 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, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics, AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY, A sequential equality constrained quadratic programming algorithm for inequality constrained optimization, A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization, An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments, A sequential quadratically constrained quadratic programming method of feasible directions, Global and local convergence of a class of penalty-free-type methods for nonlinear programming, A nonmonotone filter method for nonlinear optimization, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, Globally and superlinearly convergent QP-free algorithm for nonlinear 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, An accurate active set Newton algorithm for large scale bound constrained optimization., A modified QP-free feasible method, A feasible SQP method for nonlinear programming, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, Sequential systems of linear equations method for general constrained optimization without strict complementarity, 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, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, A kind of QP-free feasible method, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming, A penalty-function-free line search SQP method for nonlinear programming, An improved SQP algorithm for solving minimax problems, An infeasible active-set QP-free algorithm for general nonlinear programming, An active set sequential quadratic programming algorithm for nonlinear optimisation, An SQP algorithm for mathematical programs with nonlinear complementarity constraints, A feasible and superlinear algorithm for inequality constrained minimization problems, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations, An active-set algorithmic framework for non-convex optimization problems over the simplex, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, A decomposition method for Lasso problems with zero-sum constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Properties of updating methods for the multipliers in augmented Lagrangians
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• On a class fo hybrid methods for smooth constrained optimization
• A multiplier method with automatic limitation of penalty growth
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
• A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
• Recursive quadratic programming methods based on the augmented lagrangian
• Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• New Results on a Continuously Differentiable Exact Penalty Function
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Dual Variable Metric Algorithms for Constrained Optimization
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
• A Class of penalty functions for optimization problema with bound constraints
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods