| Special Issue of SJOM 2008 |
| Words from the editors: Soon-Yi Wu and Nobuo Yamashita |
Satoru Fujishige and Shigueo Isotani
A submodular function minimization algorithm based on the minimum-norm base |
Yiran He and Jie Sun
A new constraint qualification and a second-order necessary optimality condition for mathematical programming problems |
Wah June Leong and Malik Abu Hassan
Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
|
Lu Li and Kim-Chuan Toh
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
|
Qun Lin, Ryan Loxton, Kok Lay Teo and Yong Hong Wu
A new computational method for a class of free terminal time optimal control problems |
J.Z. Liu, K.F.C. Yiu and K.L. Teo
Optimal Portfolios with stress analysis and the effect of a CVaR constraint |
Xian-Jun Long and Nan-Jing Huang
Lipschitz B-preinvex functions and nonsmooth multiobjective programming |
Jian-Wen Peng and Jen-Chih Yao
An outer approximation method for generalized equilibrium problems, fixed point problems and variational inequality problems |
Ya-xiang Yuan
A trust region algorithm for Nash equilibrium problems |
| Regular Papers |
Jean Bosco Etoa Etoa
An enumeration sequential linear programming algorithm for bilevel programming with linear constraints |
B. Kheirfam
Multi-parametric linear optimization: invariant active constraints set |
Hsien-Chung Wu
Interval-valued optimization problems based on different solution concepts |
|
|
|
|