The following pages link to (Q5630864):
Displayed 50 items.
- A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem (Q495077) (← links)
- Secant relations versus positive definiteness in quasi-Newton methods (Q790711) (← links)
- A conjugate-direction method based on a nonquadratic model (Q1054276) (← links)
- A variable-metric method using a nonquadratic model (Q1054278) (← links)
- An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
- A primal-dual Newton-type algorithm for geometric programs with equality constraints (Q1062918) (← links)
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations (Q1084834) (← links)
- Iterative linear programming solution of convex programs (Q1120478) (← links)
- A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811) (← links)
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints (Q1134629) (← links)
- Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives (Q1142159) (← links)
- A class of differential descent methods for constrained optimization (Q1146118) (← links)
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications (Q1148804) (← links)
- A globally and quadratically convergent algorithm for general nonlinear programming problems (Q1151728) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- A comparative performance evaluation of 27 nonlinear programming codes (Q1171003) (← links)
- Numerical experiments with the one-dimensional non-linear simplex search (Q1184438) (← links)
- Numerical experiments on DFP-method, a powerful function minimization technique (Q1221477) (← links)
- An accelerated multiplier method for nonlinear programming (Q1225434) (← links)
- A robust conjugate-gradient algorithm which minimizes L-functions (Q1231383) (← links)
- A gradient projection-multiplier method for nonlinear programming (Q1235642) (← links)
- Comparison of generalized geometric programming algorithms (Q1243238) (← links)
- Solving geometric programs using GRG: Results and comparisons (Q1243239) (← links)
- Current state of the art of algorithms and computer software for geometric programming (Q1243249) (← links)
- Test example for nonlinear programming codes (Q1252157) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Properties of updating methods for the multipliers in augmented Lagrangians (Q1256396) (← links)
- A Newton-type curvilinear search method for constrained optimization (Q1258596) (← links)
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
- Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method (Q1825603) (← links)
- Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer (Q1836281) (← links)
- A modified homogeneous algorithm for function minimization (Q1843147) (← links)
- CGS algorithms for unconstrained minimization of functions (Q1843296) (← links)
- A feasible conjugate direction method to solve linearly constrained minimization problems (Q1843375) (← links)
- Iterative determination of parameters for an exact penalty function (Q1843377) (← links)
- An improved penalty function method for solving constrained parameter optimization problems (Q1843378) (← links)
- An interior point algorithm for nonlinear quantile regression (Q1915451) (← links)
- A pathsearch damped Newton method for computing general equilibria (Q2365112) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice (Q2493820) (← links)
- A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
- On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems (Q3761589) (← links)
- A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)