Pages that link to "Item:Q3737248"
From MaRDI portal
The following pages link to An Improved Successive Linear Programming Algorithm (Q3737248):
Displaying 34 items.
- An improved targeted climbing algorithm for linear programs (Q428484) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- Linear-programming approach to nonconvex variational problems (Q706592) (← links)
- Negotiation-based collaborative planning between supply chains partners (Q706860) (← links)
- Successive linearization methods for nonlinear semidefinite programs (Q812426) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Experiments with successive quadratic programming algorithms (Q1090233) (← links)
- Successive linear programming for ratio goal problems (Q1099080) (← links)
- Superlinear convergence of a trust region type successive linear programming method (Q1102881) (← links)
- An improved general Phase-I method in linear programming (Q1107440) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- A simple SLP algorithm for solving a class of nonlinear programs (Q1278946) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) (Q1327232) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← links)
- A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem (Q1724458) (← links)
- Trade-off preservation in inverse multi-objective convex optimization (Q1754721) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (Q1890303) (← links)
- A unified approach to global convergence of trust region methods for nonsmooth optimization (Q1890930) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- A filter-type method for solving nonlinear semidefinite programming (Q2202443) (← links)
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks (Q2331358) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Improved sequential linear programming formulation for structural weight minimization (Q2484832) (← links)
- A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS (Q4201654) (← links)
- Description of a Program for Nonlinear Programming: the Centroid Program (Q5187088) (← links)
- (Q5471517) (← links)