Browsing George R. Brown School of Engineering by Author "Zhang, Yin"
Now showing items 120 of 71

A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing
Li, Chengbo; Sun, Ting; Kelly, Kevin; Zhang, Yin (201101)Hyperspectral data processing typically demands enormous computational resources in terms of storage, computation and I/O throughputs, especially when realtime processing is desired. In this paper, we investigate a ... 
A Computational Study of a GradientBased LogBarrier Algorithm for a Class of LargeScale SDPs
Burer, Samuel; Monteiro, Renato D.C.; Zhang, Yin (200106)The authors of this paper recently introduced a transformation that converts a class of semidefinite programs (SDPs) into nonlinear optimization problems free of matrixvalued constraints and variables. This transformation ... 
A Cubically Convergent Method for Locating a Nearby Vertex in Linear Programming
Tapia, R.A.; Zhang, Yin (198912) 
A Fast Algorithm for EdgePreserving Variational Multichannel Image Restoration
Yang, Junfeng; Yin, Wotao; Zhang, Yin; Wang, Yilun (200807)We generalize the alternating minimization algorithm recently proposed in [32] to effciently solve a general, edgepreserving, variational model for recovering multichannel images degraded by within and crosschannel ... 
A Fast Newton's Algorithm for Entropy Maximization in Phase Determination
Wu, Zhijun; Phillips, George; Tapia, Richard; Zhang, Yin (199905)A longstanding problem in Xray crystallography, known as the phase problem, is to determine the phases for a large set of complex variables, called the structure factors of the crystal, given their magnitudes obtained ... 
A Fast TVL1L2 Minimization Algorithm for Signal Reconstruction from Partial Fourier Data
Yang, Junfeng; Zhang, Yin; Yin, Wotao (200810)Recent compressive sensing results show that it is possible to accurately reconstruct certain compressible signals from relatively few linear measurements via solving nonsmooth convex optimization problems. In this paper, ... 
A FixedPoint Continuation Method for L_1Regularization with Application to Compressed Sensing
Hale, Elaine T.; Yin, Wotao; Zhang, Yin (200705)We consider solving minimization problems with L_1regularization: min x_1 + mu f(x) particularly for f(x) = (1/2)AxbM2, where A is m by n and m < n. Our goal is to construct efficient and robust algorithms for ... 
A General RobustOptimization Formulation for Nonlinear Programming
Zhang, Yin (200407)Most research in robust optimization has so far been focused on inequalityonly, convex conic programming with simple linear models for uncertain parameters. Many practical optimization problems, however, are nonlinear and ... 
A Geometric Approach to Fluence Map Optimization in IMRT Cancer Treatment Planning
Zhang, Yin; Merritt, Michael (200407)Intensitymodulated radiation therapy (IMRT) is a stateoftheart technique for administering radiation to cancer patients. The goal of a treatment is to deliver a prescribed amount of radiation to the tumor, while limiting ... 
A Global Optimization Method for the Molecular Replacement Problem in Xray Crystallography
Jamrog, Diane C.; Phillips, George N. Jr.; Tapia, Richard A.; Zhang, Yin (200206)The primary technique for determining the threedimensional structure of a protein molecule is Xray crystallography, from which the molecular replacement (MR) problem often arises as a critical step. The MR problem is a ... 
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Yilun; Yang, Junfeng; Yin, Wotao; Zhang, Yin (200706)We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observa tions with total variation (TV) regularization. This algorithm arises from a new halfquadratic model ... 
A Simple Proof for Recoverability of L1Minimization (II): the Nonnegativity Case
Zhang, Yin (200509)When using L1 minimization to recover a sparse, nonnegative solution to a underdetermined linear system of equations, what is the highest sparsity level at which recovery can still be guaranteed? Recently, Donoho and ... 
A Simple Proof for Recoverability of L1Minimization: Go Over or Under?
Zhang, Yin (200508)It is wellknown by now that L1 minimization can help recover sparse solutions to underdetermined linear equations or sparsely corrupted solutions to overdetermined equations, and the two problems are equivalent under ... 
A Successive Linear Programming Approach to IMRT Optimization Problem
Merritt, Michael; Zhang, Yin; Liu, Helen; Mohan, Radhe (200212)We propose to solve the IMRT optimization problem through a successive linear programming approach. Taking advantage of the sensitivity information in linear programming and the reoptimization ability of simplex methods, ... 
A Superlinearly Convergent Polynomial PrimalDual InteriorPoint Algorithm for Linear Programming
Zhang, Yin; Tapia, Richard (199102)The choice of the centering (or barrier) parameter and the step length parameter are the fundamental issues in primaldual interiorpoint algorithms for linear programming. Various choices for these two parameters have ... 
Accelerating Convergence by Augmented RayleighRitz Projections For LargeScale Eigenpair Computation
Wen, Zaiwen; Zhang, Yin (201601)Iterative algorithms for largescale eigenpair computation are mostly based subspace projections consisting of two main steps: a subspace update (SU) step that generates bases for approximate eigenspaces, followed by a ... 
Accelerating the LeeSeung Algorithm for Nonnegative Matrix Factorization
Gonzalez, Edward F.; Zhang, Yin (200503)Approximate nonnegative matrix factorization is an emerging technique with a wide spectrum of potential applications in data analysis. Currently, the mostused algorithms for this problem are those proposed by Lee and ... 
Alternating Direction Algorithms for L1Problems in Compressive Sensing
Yang, Junfeng; Zhang, Yin (200911)In this paper, we propose and study the use of alternating direction algorithms for several L1norm minimization problems arising from sparse solution recovery in compressive sensing, including the basis pursuit problem, ... 
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
Xu, Yangyang; Yin, Wotao; Wen, Zaiwen; Zhang, Yin (201101)This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to nd nonnegative matrices X and Y from a subset of entries of a nonnegative matrix M so that XY approximates ... 
An Alternating Direction Algorithm for Nonnegative Matrix Factorization
Zhang, Yin (201001)We extend the classic alternating direction method for convex optimization to solving the nonconvex, non negative matrix factorization problem and conduct several carefully designed numerical experiments to compare the ...