搜索结果: 1-4 共查到“数学 minimization problems”相关记录4条 . 查询时间(0.205 秒)
Fast Solution of `1-norm Minimization Problems When the Solution May be Sparse
LASSO. LARS Homotopy Methods Basis Pursuit.
font style='font-size:12px;'>
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...
Optimal sets for a class of minimization problems with convex constraints
Convex geometry shape optimization isoperimetric inequalities length
font style='font-size:12px;'>
2011/2/24
We look for the minimizers of the functional J( ) = | | − P( ) among planar convex domains constrained to lie into a given ring.
Closed-Form Solutions to A Category of Nuclear Norm Minimization Problems
Closed-Form Solutions Nuclear Norm Minimization Problems
font style='font-size:12px;'>
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...
A FEASIBLE AND SUPERLINEAR ALGORITHM FOR INEQUALITY CONSTRAINED MINIMIZATION PROBLEMS
Strict complementary conditio
font style='font-size:12px;'>
2007/12/10
In this paper, a new algorithm for inequality constrained optimization problems is presented. The algorithm is feasible and is globally and superlinearly convergent under some weaker assumptions - wi...