Pages that link to "Item:Q1148785"
From MaRDI portal
The following pages link to Test examples for nonlinear programming codes (Q1148785):
Displaying 50 items.
- A tolerant algorithm for linearly constrained optimization calculations (Q910337) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- Global and local convergence of a nonmonotone trust region algorithm for equality constrained optimization (Q971994) (← links)
- Global convergence of a robust filter SQP algorithm (Q976392) (← links)
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method (Q999072) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization (Q1004230) (← links)
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
- A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure (Q1023336) (← links)
- An XML-based schema for stochastic programs (Q1026581) (← links)
- A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization (Q1031969) (← links)
- A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem (Q1032811) (← links)
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems (Q1036891) (← links)
- A Newton-like method for nonlinear system of equations (Q1039287) (← links)
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization (Q1042073) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Penalty functions, Newton's method, and quadratic programming (Q1093530) (← links)
- A heuristic algorithm for nonlinear programming (Q1093535) (← links)
- Monte Carlo optimization (Q1095042) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations (Q1106732) (← links)
- ODE versus SQP methods for constrained optimization (Q1109530) (← links)
- A comparative performance evaluation of 27 nonlinear programming codes (Q1171003) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- Modified partial-update Newton-type algorithms for unary optimization (Q1265009) (← links)
- An NE/SQP method for the bounded nonlinear complementarity problem (Q1265015) (← links)
- A generalized conjugate gradient algorithm (Q1265069) (← links)
- Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
- A continuation method for (strongly) monotone variational inequalities (Q1290602) (← links)
- An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
