Sciweavers

83 search results - page 7 / 17
» A Globally Convergent Numerical Method for a Coefficient Inv...
Sort
View
OL
2007
133views more  OL 2007»
13 years 6 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
WSC
2007
13 years 9 months ago
Sensitivity estimates from characteristic functions
We investigate the application of the likelihood ratio method (LRM) for sensitivity estimation when the relevant density for the underlying model is known only through its charact...
Paul Glasserman, Zongjian Liu
ICA
2010
Springer
13 years 8 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
COMPUTING
2010
13 years 4 months ago
Modified HSS iteration methods for a class of complex symmetric linear systems
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
Zhong-Zhi Bai, Michele Benzi, Fang Chen
MP
2002
165views more  MP 2002»
13 years 7 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi