115 search results - page 4 / 23 » On the LVI-based numerical method (E47 algorithm) for solvin... |
SIAMJO
2010
13 years 6 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
MP
2008
13 years 7 months ago
2008
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
SIAMJO
2002
13 years 7 months ago
2002
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
SIAMJO
2010
13 years 6 months ago
2010
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...