A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems

Authors:
Mary Ann Branch;Thomas F. Coleman;Yuying Li
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
1999

Citing 0
Cited 17

Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming

Computational Optimization and Applications
A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints

Journal of Computational and Applied Mathematics
Slack borrowing in flip-flop based sequential circuits

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Hardware-Assisted Feature Analysis and Visualization of Procedurally Encoded Multifield Volumetric Data

IEEE Computer Graphics and Applications
A nonlinear fractional derivative model for large uni-axial deformation behavior of polyurethane foam

Signal Processing - Fractional calculus applications in signals and systems
Hybrid genetic algorithms for parameter identification of a hysteresis model of magnetostrictive actuators

Neurocomputing
Estimating the concentration of optically active constituents of sea water by Takagi-Sugeno models with quadratic rule consequents

Pattern Recognition
Subpixel determination of imperfect circles characteristics

Pattern Recognition
Globalization strategies for Newton-Krylov methods for stabilized FEM discretization of Navier-Stokes equations

Journal of Computational Physics
Solar Radiation Data Modeling with a Novel Surface Fitting Approach

Neural Information Processing
Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities

Applied Numerical Mathematics
A quadratic programming approach to blind equalization and signal separation

IEEE Transactions on Signal Processing
Multiple Q-Shell ODF Reconstruction in Q-Ball Imaging

MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part II
Accelerating an inexact Newton/GMRES scheme by subspace decomposition

Applied Numerical Mathematics
Study of multiscale global optimization based on parameter space partition

Journal of Global Optimization
An efficient adversarial learning strategy for constructing robust classification boundaries

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
A dynamic spectrum management strategy based on cooperative bargaining framework

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

A subspace adaptation of the Coleman--Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version.Computational performance on various large test problems is reported; advantages of our approach are demonstrated. Our experience indicates that our proposed method represents an efficient way to solve large bound-constrained minimization problems.