The following pages link to Amir Beck (Q170028):
Displaying 28 items.
- A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring (Q3609034) (← links)
- Doubly Constrained Robust Capon Beamformer With Ellipsoidal Uncertainty Sets (Q4564377) (← links)
- A Minimax Chebyshev Estimator for Bounded Error Estimation (Q4567756) (← links)
- Exact and Approximate Solutions of Source Localization Problems (Q4568652) (← links)
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods (Q4571045) (← links)
- GESPAR: Efficient Phase Retrieval of Sparse Signals (Q4579008) (← links)
- Smoothing and Decomposition for Analysis Sparse Recovery (Q4579107) (← links)
- First-Order Methods in Optimization (Q4599293) (← links)
- Proximal Mapping for Symmetric Penalty and Sparsity (Q4606656) (← links)
- On Fienup Methods for Sparse Phase Retrieval (Q4621611) (← links)
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems (Q4646679) (← links)
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems (Q4664041) (← links)
- Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems (Q5003218) (← links)
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach (Q5301195) (← links)
- A Global Solution for the Structured Total Least Squares Problem with Block Circulant Matrices (Q5317663) (← links)
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems (Q5358406) (← links)
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems (Q5366152) (← links)
- A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization (Q5387987) (← links)
- On the Convergence of Block Coordinate Descent Type Methods (Q5408210) (← links)
- Quadratic Matrix Programming (Q5426905) (← links)
- New approaches to regression by generalized additive models and continuous optimization for modern applications in finance, science and technology (Q5426968) (← links)
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem (Q5470246) (← links)
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints (Q5757352) (← links)
- A probabilistic result for the max-cut problem on random graphs (Q5929142) (← links)
- A branch and bound method solving the max–min linear discriminant analysis problem (Q6078428) (← links)
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds (Q6116240) (← links)
- Exact Lipschitz regularization of convex optimization problems (Q6655789) (← links)
