搜索结果: 1-15 共查到“数学 `1-minimization”相关记录21条 . 查询时间(0.092 秒)
Minimization of the Probabilistic p-frame Potential
Frame potential equiangular tight frames probabilistic frames
2015/12/10
We investigate the optimal configurations of n points on the unit sphere for a class of potential functions. In particular, we characterize these optimal configurations in terms of theirapproximation ...
Fast Solution of `1-norm Minimization Problems When the Solution May be Sparse
LASSO. LARS Homotopy Methods Basis Pursuit.
2015/8/21
The minimum `1-norm solution to an underdetermined system of linear equations y = Ax,
is often, remarkably, also the sparsest solution to that system. This sparsity-seeking property
is of interest i...
Solving interpolation problems via generalized eigenvalue minimization
Generalized eigenvalue interpolation control system the analysis of linear matrix inequality
2015/8/12
A number of problems in the analysis and design of control systems may be reformulated as the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices which depend affi...
Enhancing sparsity by reweighted l1 minimization
1-Minimization ·Iterative reweighting Underdetermined systems of linear equations·Compressive sensing Dantzig selector· Sparsity FOCUSS
2015/8/10
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constraine...
A semidefinite programming method for integer convex quadratic minimization
The quadratic function the probability of integer zinc, values
2015/8/7
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Zn. We present a semidefinite programming (SDP) method for obtaining a nontrivial lower bound on the ...
A differential equations approach to l1-minimization with applications to array imaging
differential equations approach l1-minimization array imaging
2015/7/14
We present an ordinary differential equations approach to the analysis of algorithms for constructing l1 minimizing solutions to underdeter mined linear systems of full rank. It involves a relaxed min...
Enhancing Sparsity by Reweighted ℓ1 Minimization
ℓ 1-minimization iterative reweighting underdetermined systems of linear equations Compressive Sensing the Dantzig selector sparsity FOCUSS
2015/6/17
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constraine...
Near-ideal model selection by `1 minimization
Model selection oracle inequalities the lasso compressed sensing incoherence eigenvalues of random matrices
2015/6/17
We consider the fundamental problem of estimating the mean of a vector y = Xβ + z, where X is an n× p design matrix in which one can have far more variables than observations and z is a stochastic err...
Estimations of Lower Bounds of A Probability Minimization Problem
Probability optimization problem Lower bound estimation Binary random variable Random normal vector.
2011/11/13
This article considers the problem of \min_{\xi}\vec{Pr}(\vert \xi^Tx\vert\leq \alpha)\quad s.t.\quad \Vert\xi\Vert_2=1. We first concentrate on the case that x_i,i=1,\cdots,n are binary random variab...
Canonical dual theory applied to a Lennard-Jones potential minimization problem
Mathematical Canonical Duality Theory Mathematical Optimization Lennard-Jones Potential Minimization Problem Global Optimization
2011/9/21
Abstract: The simplified Lennard-Jones (LJ) potential minimization problem is $f(x)=4\sum_{i=1}^N \sum_{j=1,jto} x\in \mathbb{R}^n,$ where...
Discontinuous Galerkin Method for Total Variation Minimization on one-dimensional Inpainting Problem
finite element method discontinuous Galerkin method total variation minimization inpainting
2011/9/15
Abstract: This paper is concerned with the numerical minimization of energy functionals in $BV(\Omega)$ (the space of bounded variation functions) involving total variation for gray-scale 1-dimensiona...
A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms
Lanczos Method Singular Value Decomposition Eigenvalue
2011/3/1
Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems.
Optimal sets for a class of minimization problems with convex constraints
Convex geometry shape optimization isoperimetric inequalities length
2011/2/24
We look for the minimizers of the functional J( ) = | | − P( ) among planar convex domains constrained to lie into a given ring.
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in terms of energy cons...
Closed-Form Solutions to A Category of Nuclear Norm Minimization Problems
Closed-Form Solutions Nuclear Norm Minimization Problems
2010/11/24
It is an efficient and effective strategy to utilize the nuclear norm approximation to learn low-rank matrices, which arise frequently in machine learning and computer vision. So the exploration of n...