Pages that link to "Item:Q3957866"
From MaRDI portal
The following pages link to On the Local Convergence of Quasi-Newton Methods for Constrained Optimization (Q3957866):
Displaying 50 items.
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- A reduced Hessian SQP method for inequality constrained optimization (Q540630) (← links)
- A modified QP-free feasible method (Q552398) (← links)
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- Newton's method and secant methods: a longstanding relationship from vectors to matrices (Q658578) (← links)
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
- Local convergence of the interior-point Newton method for general nonlinear programming (Q704733) (← links)
- A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- A cautious BFGS update for reduced Hessian SQP (Q885498) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- A globally and superlinearly convergent modified SQP-filter method (Q933797) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A modified SQP-filter method and its global convergence (Q990647) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- A heuristic algorithm for nonlinear programming (Q1093535) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations (Q1114339) (← links)
- A trust region algorithm for equality constrained optimization (Q1174456) (← links)
- A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- Perturbation lemma for the Newton method with application to the SQP Newton method (Q1265001) (← links)
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming (Q1317308) (← links)
- Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
- Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms (Q1321339) (← links)
- Two-step and three-step Q-superlinear convergence of SQP methods (Q1342465) (← links)
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
- New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561) (← links)
- Sequential quadratic programming for large-scale nonlinear optimization (Q1593815) (← links)
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
- A successive quadratic programming method that uses new corrections for search directions (Q1919937) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems (Q1942263) (← links)
- An approximate Jacobian nonlinear solver for multiphase flow and transport (Q2002253) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- Exact penalty function algorithm with simple updating of the penalty parameter (Q2277155) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)
- Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization (Q2767580) (← links)
- Multilevel least-change Newton-like methods for equality constrained optimization problems (Q3028736) (← links)
- Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120) (← links)
- An example of irregular convergence in some constrained optimization methods that use the projected hessian (Q3696876) (← links)
- A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
