33 search results - page 2 / 7 » Proximal Interior Point Approach for Solving Convex Semi-inf... |
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
JGO
2011
13 years 8 days ago
2011
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
EOR
2010
13 years 5 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
OL
2007
13 years 4 months ago
2007
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...