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):
Displayed 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← 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)
- 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 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)
- Two-step and three-step Q-superlinear convergence of SQP methods (Q1342465) (← links)
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
- New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
- Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
- A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
- A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations (Q1576323) (← links)
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- Computational methods for optimum design of large complex systems (Q1820022) (← links)
- A robust sequential quadratic programming method (Q1825141) (← links)
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575) (← links)
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
- Sparse quadratic programming in chemical process optimization (Q2368094) (← links)