Solution of steady-state one-dimensional conservation laws by mathematical programming
SIAM Journal on Numerical Analysis
Solution of steady-state, two-dimensional conservation laws by mathematical programming
SIAM Journal on Numerical Analysis
Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Primal-dual interior-point methods
Primal-dual interior-point methods
Computer Aided Geometric Design
Convex Optimization
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
Journal of Mathematical Imaging and Vision
A compressed primal-dual method for generating bivariate cubic L1 splines
Journal of Computational and Applied Mathematics
L1-minimization methods for Hamilton–Jacobi equations: the one-dimensional case
Numerische Mathematik
Computer Aided Geometric Design
Decoding by linear programming
IEEE Transactions on Information Theory
Hi-index | 0.00 |
A surface reconstruction technique based on the L 1- minimization of the variation of the gradient is introduced. This leads to a non-smooth convex programming problem. Well-posedness and convergence of the method is established and an interior point based algorithm is introduced. The L 1-surface reconstruction algorithm is illustrated on various test cases including natural and urban terrain data.