| Publication | Date of Publication | Type |
|---|
Exact Lipschitz regularization of convex optimization problems
Journal of Optimization Theory and Applications | 2024-12-27 | Paper |
A branch and bound method solving the max–min linear discriminant analysis problem
Optimization Methods & Software | 2023-09-27 | Paper |
| Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with Python and MATLAB, Second Edition | 2023-09-06 | Paper |
A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
SIAM Journal on Optimization | 2023-08-11 | Paper |
The regularized feasible directions method for nonconvex optimization
Operations Research Letters | 2022-10-17 | Paper |
An accelerated coordinate gradient descent algorithm for non-separable composite optimization
Journal of Optimization Theory and Applications | 2022-05-17 | Paper |
Sparse regularization via bidualization
Journal of Global Optimization | 2022-03-15 | Paper |
New results on multi-dimensional linear discriminant analysis
Operations Research Letters | 2022-03-11 | Paper |
Dual randomized coordinate descent method for solving a class of nonconvex problems
SIAM Journal on Optimization | 2021-07-20 | Paper |
On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
SIAM Journal on Optimization | 2020-01-21 | Paper |
Optimization problems involving group sparsity terms
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
| Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems | 2019-05-21 | Paper |
On Fienup Methods for Sparse Phase Retrieval
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
Optimization Methods & Software | 2019-01-14 | Paper |
Globally solving a class of optimal power flow problems in radial networks by tree reduction
Journal of Global Optimization | 2018-12-07 | Paper |
Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
Operations Research Letters | 2018-09-28 | Paper |
A fast dual proximal gradient algorithm for convex minimization and applications
Operations Research Letters | 2018-08-27 | Paper |
GESPAR: Efficient Phase Retrieval of Sparse Signals
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Smoothing and Decomposition for Analysis Sparse Recovery
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Globally solving the trust region subproblem using simple first-order methods
SIAM Journal on Optimization | 2018-07-06 | Paper |
A Minimax Chebyshev Estimator for Bounded Error Estimation
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
Exact and Approximate Solutions of Source Localization Problems
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
Doubly Constrained Robust Capon Beamformer With Ellipsoidal Uncertainty Sets
IEEE Transactions on Signal Processing | 2018-06-12 | Paper |
Proximal mapping for symmetric penalty and sparsity
SIAM Journal on Optimization | 2018-03-09 | Paper |
Primal and dual predicted decrease approximation methods
Mathematical Programming. Series A. Series B | 2018-02-12 | Paper |
| First-order methods in optimization | 2017-12-28 | Paper |
A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Journal of Global Optimization | 2017-11-09 | Paper |
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
IEEE Transactions on Image Processing | 2017-10-09 | Paper |
An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
IEEE Transactions on Control of Network Systems | 2017-09-21 | Paper |
Linearly convergent away-step conditional gradient for non-strongly convex functions
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
SIAM Journal on Optimization | 2017-01-13 | Paper |
An alternating semiproximal method for nonconvex regularized structured total least squares problems
SIAM Journal on Matrix Analysis and Applications | 2016-09-07 | Paper |
The sparse principal component analysis problem: optimality conditions and algorithms
Journal of Optimization Theory and Applications | 2016-08-31 | Paper |
On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
Mathematics of Operations Research | 2016-04-15 | Paper |
The cyclic block conditional gradient method for convex optimization problems
SIAM Journal on Optimization | 2015-11-04 | Paper |
Weiszfeld's method: old and new results
Journal of Optimization Theory and Applications | 2015-03-11 | Paper |
| Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB | 2015-01-20 | Paper |
The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
Journal of Optimization Theory and Applications | 2014-10-23 | Paper |
A first order method for finding minimal norm-like solutions of convex optimization problems
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
On the convergence of block coordinate descent type methods
SIAM Journal on Optimization | 2014-04-09 | Paper |
Sparsity constrained nonlinear optimization: optimality conditions and algorithms
SIAM Journal on Optimization | 2013-12-13 | Paper |
An improved ellipsoid method for solving convex differentiable optimization problems
Operations Research Letters | 2013-03-05 | Paper |
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
Operations Research Letters | 2012-09-18 | Paper |
Smoothing and first order methods: a unified framework
SIAM Journal on Optimization | 2012-09-12 | Paper |
On the solution of the GPS localization and circle fitting problems
SIAM Journal on Optimization | 2012-08-22 | Paper |
A sequential ascending parameter method for solving constrained minimization problems
SIAM Journal on Optimization | 2012-08-22 | Paper |
A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
Springer Optimization and Its Applications | 2012-07-10 | Paper |
| Gradient-based algorithms with applications to signal-recovery problems | 2011-03-02 | Paper |
Structured total maximum likelihood: an alternative to structured total least squares
SIAM Journal on Matrix Analysis and Applications | 2011-03-02 | Paper |
The CoMirror algorithm for solving nonsmooth constrained convex problems
Operations Research Letters | 2010-12-23 | Paper |
| On minimizing quadratically constrained ratio of two quadratic functions | 2010-11-18 | Paper |
The matrix-restricted total least-squares problem
Signal Processing | 2010-05-19 | Paper |
A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
Journal of Global Optimization | 2010-05-07 | Paper |
Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
Journal of Optimization Theory and Applications | 2009-11-04 | Paper |
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences | 2009-10-19 | Paper |
Iterative Minimization Schemes for Solving the Single Source Localization Problem
SIAM Journal on Optimization | 2009-08-20 | Paper |
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring
SIAM Journal on Matrix Analysis and Applications | 2009-03-06 | Paper |
Duality in robust optimization: Primal worst equals dual best
Operations Research Letters | 2009-02-23 | Paper |
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences | 2009-01-01 | Paper |
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
Journal of Global Optimization | 2008-09-23 | Paper |
Mean-Squared Error Estimation for Linear Systems with Block Circulant Uncertainty
SIAM Journal on Matrix Analysis and Applications | 2008-08-01 | Paper |
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization
Mathematics of Operations Research | 2008-05-27 | Paper |
Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
SIAM Journal on Matrix Analysis and Applications | 2008-04-29 | Paper |
New approaches to regression by generalized additive models and continuous optimization for modern applications in finance, science and technology
Optimization | 2007-11-16 | Paper |
Quadratic Matrix Programming
SIAM Journal on Optimization | 2007-11-16 | Paper |
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
SIAM Journal on Optimization | 2007-09-06 | Paper |
Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
SIAM Journal on Matrix Analysis and Applications | 2007-05-03 | Paper |
Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
SIAM Journal on Optimization | 2006-05-30 | Paper |
A Global Solution for the Structured Total Least Squares Problem with Block Circulant Matrices
SIAM Journal on Matrix Analysis and Applications | 2005-09-19 | Paper |
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
Optimization Methods & Software | 2005-04-05 | Paper |
A conditional gradient method with linear rate of convergence for solving convex linear systems
Mathematical Methods of Operations Research | 2005-02-11 | Paper |
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Operations Research Letters | 2003-06-17 | Paper |
Global optimality conditions for quadratic optimization problems with binary constraints
SIAM Journal on Optimization | 2001-03-19 | Paper |
A probabilistic result for the max-cut problem on random graphs
Operations Research Letters | 2001-01-01 | Paper |
