A surperlinearly convergent algorithm for constrained optimization problems
From MaRDI portal
Publication:3934161
DOI10.1007/BFB0120947zbMath0477.90071OpenAlexW79353284MaRDI QIDQ3934161
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120947
global convergenceconstrained optimizationquadratic approximationexact penalty functionsearch directionsuperlinear rate of convergence
Related Items (71)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A two-parameter exact penalty function for nonlinear programming ⋮ On combining feasibility, descent and superlinear convergence in inequality constrained optimization ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate ⋮ A modified SQP algorithm for minimax problems ⋮ A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ Nonlinear programming without a penalty function or a filter ⋮ An integral transform approach to cross-variograms modeling ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ An analysis of reduced Hessian methods for constrained optimization ⋮ Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization ⋮ A successive quadratic programming algorithm with global and superlinear convergence properties ⋮ Smoothed penalty algorithms for optimization of nonlinear models ⋮ Sequential quadratic programming with step control using the Lagrange function ⋮ An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point ⋮ A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence ⋮ Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints ⋮ A successive quadratic programming method that uses new corrections for search directions ⋮ A superlinearly convergent numerical algorithm for nonlinear programming ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ A penalty-free method with superlinear convergence for equality constrained optimization ⋮ An overview of nonlinear optimization ⋮ Switching stepsize strategies for sequential quadratic programming ⋮ Global convergence of inexact reduced sqp methods ⋮ Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Computer-aided design via optimization: A review ⋮ Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité ⋮ Partitioned quasi-Newton methods for nonlinear equality constrained optimization ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization ⋮ On the local and global convergence of a reduced Quasi-Newton method1 ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ 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 ⋮ A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ Global and local convergence of a filter line search method for nonlinear programming ⋮ Exact penalty function algorithm with simple updating of the penalty parameter ⋮ Superlinearly convergent algorithm for min-max problems ⋮ A globalization scheme for the generalized Gauss-Newton method ⋮ Wing aerodynamic optimization using efficient mathematically-extracted modal design variables ⋮ Preface ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ Second-order conditions for an exact penalty function ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ Nonmonotone line search algorithm for constrained minimax problems ⋮ An exact penalty function algorithm for semi-infinite programmes ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ Numerical experiments in semi-infinite programming ⋮ On the Local Convergence of a Penalty-Function-Free SQP Method ⋮ A Method for Constrained Multiobjective Optimization Based on SQP Techniques ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ A feasible and superlinear algorithm for inequality constrained minimization problems ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization ⋮ A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations ⋮ An SQP method for general nonlinear programs using only equality constrained subproblems ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ A globally and superlinearly convergent feasible QP-free method for nonlinear programming ⋮ Feasible direction algorithm for optimal control problems with state and control constraints: Implementation ⋮ Convergent stepsizes for constrained optimization algorithms ⋮ A globally convergent algorithm for nonlinearly constrained optimization problems ⋮ Equality and inequality constrained optimization algorithms with convergent stepsizes ⋮ Nonmonotone line search for minimax problems
This page was built for publication: A surperlinearly convergent algorithm for constrained optimization problems
