Pages that link to "Item:Q4139993"
From MaRDI portal
The following pages link to Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993):
Displaying 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- Hybrid functions of Bernstein polynomials and block-pulse functions for solving optimal control of the nonlinear Volterra integral equations (Q297999) (← links)
- A factorization with update procedures for a KKT matrix arising in direct optimal control (Q384809) (← links)
- 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 family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables (Q488922) (← links)
- A modified QP-free feasible method (Q552398) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- A multi-objective approach to the design of low thrust space trajectories using optimal control (Q642294) (← links)
- Augmented Lagrangians which are quadratic in the multiplier (Q754765) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) (← links)
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← 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)
- Optimal fleet allocation of freeway service patrols (Q862479) (← 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)
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences (Q1016107) (← links)
- A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- An active set RQP algorithm for engineering design optimization (Q1075123) (← links)
- On minimax eigenvalue problems via constrained optimization (Q1090242) (← links)
- Dual techniques for constrained optimization (Q1091272) (← links)
- A heuristic algorithm for nonlinear programming (Q1093535) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- Control parametrization: a unified approach to optimal control problems with general constraints (Q1098400) (← links)
- Recent developments in constrained optimization (Q1112728) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- Iterative linear programming solution of convex programs (Q1120478) (← links)
- A robust secant method for optimization problems with inequality constraints (Q1136347) (← links)
- Globally convergent methods for semi-infinite programming (Q1159954) (← links)
- A recursive quadratic programming algorithm for semi-infinite optimization problems (Q1169401) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- Complete decomposition algorithm for nonconvex separable optimization problems and applications (Q1195824) (← links)
- A globally convergent method for nonlinear programming (Q1229804) (← links)
- Properties of updating methods for the multipliers in augmented Lagrangians (Q1256396) (← links)
- Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization (Q1294445) (← links)
- A sequential quadratic programming-based algorithm for the optimization of gas networks (Q1314761) (← links)
- Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)