default search action
Optimization Methods and Software , Volume 18
Volume 18, Number 1, 2003
- Samuel Burer, Renato D. C. Monteiro:
A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. 1-38 - Pamela J. Williams, Amr S. El-Bakry, Richard A. Tapia:
Using Indicators in Finite Termination Procedures. 39-52 - Igor V. Konnov:
On Convergence Properties of a Subgradient Method. 53-62 - Kaisa Miettinen, Alexander V. Lotov, George K. Kamenev, Vadim E. Berezkin:
Integration of Two Multiobjective Optimization Methods for Nonlinear Problems. 63-80 - Leonidas D. Iasemidis, Panos M. Pardalos, Deng-Shan Shiau, Wanpracha Art Chaovalitwongse, K. Narayanan, Shiv Kumar, Paul R. Carney, J. Chris Sackellares:
Prediction of Human Epileptic Seizures based on Optimization and Phase Changes of Brain Electrical Activity. 81-104 - Karsten Eppler, Helmut Harbrecht:
Numerical Solution of Elliptic Shape Optimization Problems using wavelet-based BEM. 105-123
Volume 18, Number 2, 2003
- Masao Fukushima, Ya-Xiang Yuan:
Foreword. 127
- Yuichi Asahiro, Masahiro Ishibashi, Masafumi Yamashita:
Independentand cooperative parallel search methods for the generalized assignment problem. 129-141 - Satoru Fujishige:
Submodular function minimization and related topics. 167-180 - Qiying Hu, Wuyi Yue:
Optimal replacement of a system according toa semi-Markov decision process in a semi-Markov environment. 181-196 - Hidefumi Kawasaki:
Analysis of conjugate points for constant tridiagonal Hesse matrices of a class of extremal problems. 197-205 - Satoko Moriguchi, Kazuo Murota:
Capacity scaling algorithm for scalable M-convex submodular flow problems. 207-218 - Siegfried Schaible, Jianming Shi:
Fractional programming: The sum-of-ratios case. 219-229 - Akihisa Tamura:
On convolution of L-convex functions. 231-245
Volume 18, Number 3, 2003
- Yuhong Dai, John D. Lamb, Wenbin Liu:
Novel supervisor-searcher cooperation algorithms for minimization problems with strong noise. 247-264 - Abdel-Rahman Hedar, Masao Fukushima:
Minimizing multimodal functions by simplex coding genetic algorithm. 265-282 - Qin Ni:
A globally convergent method of moving asymptotes with trust region technique. 283-297 - Michael Hinze, Thomas Slawig:
Adjoint gradients compared to gradients from algorithmic differentiation in instantaneous control of the Navier-Stokes equations. 299-315 - Michal Kocvara, Michael Stingl:
PENNON: A code for convex nonlinear and semidefinite programming. 317-333 - János D. Pintér:
Globally optimized calibration of nonlinear models: Techniques, software, and applications. 335-355
Volume 18, Number 4, 2003
- Alfred Auslender:
Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone. 359-376 - Amir Beck, Marc Teboulle:
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems. 377-394 - Jun-ya Gotoh, Nguyen Van Thoai, Yoshitsugu Yamamoto:
Global optimization method for solving the minimum maximal flow problem. 395-415 - Takayuki Ishizeki, Hiroshi Imai:
Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs. 417-426 - Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige:
Source location problem with flow requirements in directed networks. 427-435 - Masafumi Ito, Ryuichi Hirabayashi:
Computing test sets for integer programming. 437-452 - Gang Kou, Xiantao Liu, Yi Peng, Yong Shi, Morgan Wise, Weixuan Xu:
Multiple criteria linear programming approach to data mining: Models, algorithm designs and software development. 453-473 - Yukihiro Maruyama:
Strong representation theorems for bitone sequential decision processes. 475-489 - Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). 491-505
Volume 18, Number 5, 2003
- John E. Mitchell:
Polynomial interior point cutting plane methods. 507-534 - Sunyoung Kim, Masakazu Kojima, Makoto Yamashita:
Second order cone programming relaxation of a positive semidefinite constraint. 535-541 - Yair Censor, Eli Tom:
Convergence of string-averaging projection schemes for inconsistent convex feasibility problems. 543-554 - John L. Nazareth:
On conjugate gradient algorithms as objects of scientific study. 555-565 - Yifan Xu:
A mixed and superlinearly convergent algorithm for constrained optimization. 567-581 - William La Cruz, Marcos Raydan:
Nonmonotone spectral methods for large-scale nonlinear systems. 583-599 - Torbjörn Larsson, Michael Patriksson, Clas Rydergren:
Inverse nonlinear multicommodity flow optimization by column generation. 601-613 - Francois Courty, Alain Dervieux, Bruno Koobus, Laurent Hascoët:
Reverse automatic differentiation for optimum design: from adjoint state assembly to gradient computation. 615-627
Volume 18, Number 6, 2003
- Cornelis Roos, Jianzhong Zhang:
Foreword. 629
- Yan-Qin Bai, Cornelis Roos:
A polynomial-time algorithm for linear optimization based on a new simple kernel function. 631-646 - Yong He, Ting Chen:
Optimal algorithms for recombination distance problem. 647-655 - Ying-Jun Jiang, Dong-Hui Li, Jin-Ping Zeng:
Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems. 657-672 - A. Ismael F. Vaz, Edite M. G. P. Fernandes, M. Paula S. F. Gomes:
A quasi-Newton interior point method for semi-infinite programming. 673-687 - Vladimir M. Veliov:
Newton's method for problems of optimal control of heterogeneous systems. 689-703 - Dachuan Xu, Yinyu Ye, Jiawei Zhang:
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations. 705-719 - Jinghao Zhu, Kangdi Li:
An iterative method for solving stochastic Riccati differential equations for the stochastic LQR problem. 721-732
- Paul Tseng:
Book review. 733 - Panos M. Pardalos:
Book review. 735-736
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.