A new trust region technique for the maximum weight clique problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A projection based multiscale optimization method for eigenvalue problems
Journal of Global Optimization
Algorithm 873: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization
ACM Transactions on Mathematical Software (TOMS)
Localization through Map Stitching in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Solving the quadratic trust-region subproblem in a low-memory BFGS framework
Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
A Subspace Minimization Method for the Trust-Region Step
SIAM Journal on Optimization
Accelerating the LSTRS Algorithm
SIAM Journal on Scientific Computing
Behavior of DCA sequences for solving the trust-region subproblem
Journal of Global Optimization
Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
Operations Research
Updating the regularization parameter in the adaptive cubic regularization algorithm
Computational Optimization and Applications
| Hi-index | 0.00 |
A new method, the sequential subspace method (SSM), is developed for the problem of minimizing a quadratic over a sphere. In our scheme, the quadratic is minimized over a subspace which is adjusted in successive iterations to ensure convergence to an optimum. When a sequential quadratic programming iterate is included in the subspace, convergence is locally quadratic. Numerical comparisons with other recent methods are given.