On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
From MaRDI portal
Publication:3957866
DOI10.1137/0320014zbMath0494.65036OpenAlexW2108814972MaRDI QIDQ3957866
Pyng Wang, Paul T. Boggs, Jon W. Tolle
Publication date: 1982
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0320014
Related Items
An example of irregular convergence in some constrained optimization methods that use the projected hessian, Two-step and three-step Q-superlinear convergence of SQP methods, A heuristic algorithm for nonlinear programming, A projected Newton method for minimization problems with nonlinear inequality constraints, 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, Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, Convergence of the BFGS-SQP Method for Degenerate Problems, A successive quadratic programming algorithm with global and superlinear convergence properties, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, New sequential quadratic programming algorithm with consistent subproblems, A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control, An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations, Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, Sequential penalty algorithm for nonlinear constrained optimization, A successive quadratic programming method that uses new corrections for search directions, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, Unification of basic and composite nondifferentiable optimization, A superlinearly convergent numerical algorithm for nonlinear programming, A cautious BFGS update for reduced Hessian SQP, An improved feasible QP-free algorithm for inequality constrained optimization, A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems, Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, The strict superlinear order can be faster than the infinite order, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, An efficient algorithm for a class of equality-constrained optimization problems, A trust region algorithm for equality constrained optimization, Newton's method and secant methods: a longstanding relationship from vectors to matrices, A quasi-Newton modified LP-Newton method, A globally and superlinearly convergent modified SQP-filter method, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization, A constrained min-max algorithm for rival models of the same economic system, A modified SQP method and its global convergence, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, On the local and global convergence of a reduced Quasi-Newton method1, The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization, An approximate Jacobian nonlinear solver for multiphase flow and transport, Multilevel least-change Newton-like methods for equality constrained optimization problems, A reduced Hessian SQP method for inequality constrained optimization, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization, Local convergence of the interior-point Newton method for general nonlinear programming, A modified QP-free feasible method, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, Exact penalty function algorithm with simple updating of the penalty parameter, A practical update criterion for SQP method, A modified SQP-filter method and its global convergence, Perturbation lemma for the Newton method with application to the SQP Newton method, An infeasible active-set QP-free algorithm for general nonlinear programming, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, On the Local Convergence of a Penalty-Function-Free SQP Method, On Secant Updates for Use in General Constrained Optimization, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, Unnamed Item, A class of superlinearly convergent projection algorithms with relaxed stepsizes, Sequential quadratic programming for large-scale nonlinear optimization, Convergent stepsizes for constrained optimization algorithms, Local analysis of Newton-type methods for variational inequalities and nonlinear programming, Local properties of algorithms for minimizing nonsmooth composite functions, Equality and inequality constrained optimization algorithms with convergent stepsizes, Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms, Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
