The following pages link to Amir Beck (Q170028):
Displaying 50 items.
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems (Q150994) (← links)
- (Q306304) (redirect page) (← links)
- The sparse principal component analysis problem: optimality conditions and algorithms (Q306306) (← links)
- (Q453057) (redirect page) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- (Q587288) (redirect page) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- Primal and dual predicted decrease approximation methods (Q681488) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- A sequential parametric convex approximation method with applications to nonconvex truss topology design problems (Q969739) (← links)
- The matrix-restricted total least-squares problem (Q971001) (← links)
- Duality in robust optimization: Primal worst equals dual best (Q1002073) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- (Q1035904) (redirect page) (← links)
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
- Globally solving a class of optimal power flow problems in radial networks by tree reduction (Q1630266) (← links)
- A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- A conditional gradient method with linear rate of convergence for solving convex linear systems (Q1762672) (← links)
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
- Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
- An improved ellipsoid method for solving convex differentiable optimization problems (Q1939709) (← links)
- The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
- Sparse regularization via bidualization (Q2114593) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- Weiszfeld's method: old and new results (Q2260646) (← links)
- Optimization problems involving group sparsity terms (Q2330642) (← links)
- Linearly convergent away-step conditional gradient for non-strongly convex functions (Q2364483) (← links)
- Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems (Q2415211) (← links)
- Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties (Q2492687) (← links)
- New results on multi-dimensional linear discriminant analysis (Q2670460) (← links)
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints (Q2706322) (← links)
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms (Q2800370) (← links)
- An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems (Q2818270) (← links)
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms (Q2866194) (← links)
- A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (Q2897274) (← links)
- On the Solution of the GPS Localization and Circle Fitting Problems (Q2902872) (← links)
- A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems (Q2902879) (← links)
- Smoothing and First Order Methods: A Unified Framework (Q2910884) (← links)
- Introduction to Nonlinear Optimization (Q2940781) (← links)
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes (Q2954382) (← links)
- (Q3057943) (← links)
- (Q3079664) (← links)
- Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares (Q3079762) (← links)
- Iterative Minimization Schemes for Solving the Single Source Localization Problem (Q3395023) (← links)
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares (Q3435006) (← links)
- The Cyclic Block Conditional Gradient Method for Convex Optimization Problems (Q3449572) (← links)
- Mean-Squared Error Estimation for Linear Systems with Block Circulant Uncertainty (Q3516124) (← links)
