The following pages link to Yasutoshi Yajima (Q241411):
Displaying 21 items.
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- Linear programming approaches for multicategory support vector machines (Q706935) (← links)
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A polyhedral approach for nonconvex quadratic programming problems with box constraints (Q1273053) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- (Q2751323) (← links)
- EXTRACTING FEATURE SUBSPACE FOR KERNEL BASED LINEAR PROGRAMMING SUPPORT VECTOR MACHINES (Q3043675) (← links)
- Ranking and selecting terms for text categorization via SVM discriminate boundary (Q3065300) (← links)
- A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM (Q4345056) (← links)
- (Q4426966) (← links)
- (Q4527209) (← links)
- (Q4703898) (← links)
- OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS (Q4860014) (← links)
- Positive semidefinite relaxations for distance geometry problems. (Q5960873) (← links)
