A Convergent Variant of the Nelder–Mead Algorithm C.J. PriceI.D. CoopeD. Byatt OriginalPaper Pages: 5 - 19
Comparison of Two Sets of First-Order Conditions as Bases of Interior-Point Newton Methods for Optimization with Simple Bounds D.C. JamrogR.A. TapiaY. Zhang OriginalPaper Pages: 21 - 40
Convexifactors, Generalized Convexity, and Optimality Conditions J. DuttaS. Chandra OriginalPaper Pages: 41 - 64
New Lagrangian Relaxation Based Algorithm for Resource Scheduling with Homogeneous Subproblems X.H. GuanQ.Z. ZhaiF. Lai OriginalPaper Pages: 65 - 82
Maximizing a Linear Fractional Function on a Pareto Efficient Frontier S.T. HackmanU. Passy OriginalPaper Pages: 83 - 103
Robust Decentralized Stabilization of Uncertain Large-Scale Discrete-Time Systems with Delays J.H. Park OriginalPaper Pages: 105 - 119
Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems L. QiD. Sun OriginalPaper Pages: 121 - 147
On the Local Uniqueness of Solutions of Variational Inequalities Under H-Differentiability M.A. Tawhid OriginalPaper Pages: 149 - 164
Convergence and Application of a Decomposition Method Using Duality Bounds for Nonconvex Global Optimization N.V. Thoai OriginalPaper Pages: 165 - 193