| Publication | Date of Publication | Type |
|---|
| A highly efficient algorithm for solving exclusive lasso problems | 2024-11-20 | Paper |
| Learning graph Laplacian with MCP | 2024-11-20 | Paper |
| A feasible method for general convex low-rank SDP problems | 2024-07-16 | Paper |
| A Riemannian dimension-reduced second-order method with application in sensor network localization | 2024-06-26 | Paper |
| A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems | 2024-05-10 | Paper |
| A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem | 2024-03-05 | Paper |
| Dissolving Constraints for Riemannian Optimization | 2024-03-05 | Paper |
| Solving graph equipartition SDPs on an algebraic variety | 2024-02-21 | Paper |
| A feasible method for general convex low-rank SDP problems | 2023-12-13 | Paper |
| A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems | 2023-11-10 | Paper |
| An Improved Unconstrained Approach for Bilevel Optimization | 2023-10-17 | Paper |
| Self-adaptive ADMM for semi-strongly convex problems | 2023-09-30 | Paper |
| On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models | 2023-08-31 | Paper |
| On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems | 2023-08-03 | Paper |
| An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization | 2023-08-01 | Paper |
| Quantifying low rank approximations of third order symmetric tensors | 2023-07-20 | Paper |
| Adaptive sieving: A dimension reduction technique for sparse optimization problems | 2023-06-29 | Paper |
| A Highly Efficient Algorithm for Solving Exclusive Lasso Problems | 2023-06-25 | Paper |
| An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems | 2023-04-28 | Paper |
| A Riemannian Dimension-reduced Second Order Method with Application in Sensor Network Localization | 2023-04-20 | Paper |
| A Partial Exact Penalty Function Approach for Constrained Optimization | 2023-04-03 | Paper |
| QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems | 2023-03-29 | Paper |
| A squared smoothing Newton method for semidefinite programming | 2023-03-10 | Paper |
| A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering | 2022-09-29 | Paper |
| On degenerate doubly nonnegative projection problems | 2022-09-26 | Paper |
| Bregman proximal point algorithm revisited: a new inexact version and its inertial variant | 2022-07-29 | Paper |
| An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems | 2022-06-16 | Paper |
| Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints | 2022-06-14 | Paper |
| A Constraint Dissolving Approach for Nonsmooth Optimization over the Stiefel Manifold | 2022-05-21 | Paper |
| A new homotopy proximal variable-metric framework for composite convex minimization | 2022-05-17 | Paper |
| Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination | 2022-03-28 | Paper |
| Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Relative Stopping Criteria | 2021-09-12 | Paper |
| On Regularized Square-root Regression Problems: Distributionally Robust Interpretation and Fast Computations | 2021-09-08 | Paper |
| Subspace quadratic regularization method for group sparse multinomial logistic regression | 2021-08-09 | Paper |
| An inexact augmented Lagrangian method for second-order cone programming with applications | 2021-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998873 | 2021-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998892 | 2021-07-09 | Paper |
| An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems | 2021-07-06 | Paper |
| A Newton-bracketing method for a simple conic optimization problem | 2021-07-06 | Paper |
| QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems | 2021-03-24 | Paper |
| Lagrangian-conic relaxations. II: Applications to polynomial optimization problems | 2021-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5149020 | 2021-02-05 | Paper |
| Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems | 2021-02-03 | Paper |
| On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming | 2021-01-25 | Paper |
| Solving Challenging Large Scale QAPs | 2021-01-23 | Paper |
| An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems | 2020-11-29 | Paper |
| A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming | 2020-10-27 | Paper |
| Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models | 2020-09-18 | Paper |
| An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming | 2020-09-17 | Paper |
| A proximal point dual Newton algorithm for solving group graphical Lasso problems | 2020-08-18 | Paper |
| Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures | 2020-05-26 | Paper |
| A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems | 2020-05-20 | Paper |
| Algorithm 996 | 2020-04-24 | Paper |
| Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian | 2020-02-25 | Paper |
| Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method | 2020-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5210158 | 2020-01-22 | Paper |
| On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope | 2020-01-17 | Paper |
| An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems | 2020-01-17 | Paper |
| Mesh Independence of a Majorized ABCD Method for Sparse PDE-constrained Optimization Problems | 2020-01-03 | Paper |
| Best nonnegative rank-one approximations of tensors | 2019-12-09 | Paper |
| SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) | 2019-11-25 | Paper |
| Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone | 2019-11-08 | Paper |
| On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming | 2019-10-22 | Paper |
| Efficient sparse semismooth Newton methods for the clustered Lasso problem | 2019-08-27 | Paper |
| A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications | 2019-05-17 | Paper |
| QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming | 2019-05-03 | Paper |
| A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems | 2019-03-27 | Paper |
| Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems | 2018-12-27 | Paper |
| A semi-proximal augmented Lagrangian based decomposition method for primal block angular convex composite quadratic conic programming problems | 2018-12-12 | Paper |
| Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm | 2018-10-04 | Paper |
| A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters | 2018-09-12 | Paper |
| On efficiently solving the subproblems of a level-set method for fused lasso problems | 2018-07-03 | Paper |
| Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity | 2018-06-25 | Paper |
| Spectral operators of matrices | 2018-04-06 | Paper |
| Bounds for random binary quadratic programs | 2018-04-03 | Paper |
| Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination | 2018-04-03 | Paper |
| A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems | 2018-03-09 | Paper |
| Max-norm optimization for robust matrix recovery | 2018-02-12 | Paper |
| A unified formulation and fast accelerated proximal gradient method for classification | 2017-09-27 | Paper |
| A bounded degree SOS hierarchy for polynomial optimization | 2017-05-23 | Paper |
| A robust Lagrangian-DNN method for a class of quadratic optimization problems | 2017-04-21 | Paper |
| A note on the convergence of ADMM for linearly constrained convex optimization problems | 2017-03-07 | Paper |
| An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming | 2017-02-03 | Paper |
| On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions | 2016-10-04 | Paper |
| On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions | 2016-07-01 | Paper |
| An efficient inexact ABCD method for least squares semidefinite programming | 2016-05-13 | Paper |
| On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0 | 2016-04-26 | Paper |
| A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization | 2016-04-25 | Paper |
| A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems | 2016-04-04 | Paper |
| A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions | 2016-02-23 | Paper |
| A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems | 2016-02-23 | Paper |
| A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block | 2015-10-06 | Paper |
| SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints | 2015-09-30 | Paper |
| A partial proximal point algorithm for nuclear norm regularized matrix least squares problems | 2015-09-16 | Paper |
| A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints | 2015-06-11 | Paper |
| Image restoration with mixed or unknown noises | 2015-05-19 | Paper |
| Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting | 2015-02-10 | Paper |
| On the Moreau-Yosida regularization of the vector \(k\)-norm related functions | 2014-09-26 | Paper |
| A Probabilistic Model for Minmax Regret in Combinatorial Optimization | 2014-06-26 | Paper |
| An introduction to a class of matrix cone programming | 2014-06-02 | Paper |
| Comparison between iterative solution of symmetric and non-symmetric forms of Biot's FEM equations using the generalized Jacobi preconditioner | 2013-10-24 | Paper |
| A proximal point algorithm for log-determinant optimization with group Lasso regularization | 2013-09-25 | Paper |
| Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints | 2013-09-13 | Paper |
| Using a distributed SDP approach to solve simulated protein molecular conformation problems | 2013-07-29 | Paper |
| A proximal point algorithm for sequential feature extraction applications | 2013-04-29 | Paper |
| Infeasible potential reduction algorithms for semidefinite programming | 2013-02-07 | Paper |
| An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP | 2013-01-04 | Paper |
| An implementable proximal point algorithmic framework for nuclear norm minimization | 2012-06-26 | Paper |
| Quantum discord bounds the amount of distributed entanglement | 2012-03-06 | Paper |
| A block coordinate gradient descent method for regularized convex separable optimization and covariance selection | 2011-11-07 | Paper |
| An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach | 2011-06-30 | Paper |
| A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization | 2011-05-11 | Paper |
| Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm | 2011-03-21 | Paper |
| A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP | 2011-02-23 | Paper |
| An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection | 2011-01-28 | Paper |
| A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming | 2011-01-21 | Paper |
| An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization | 2011-01-10 | Paper |
| A Newton-CG augmented Lagrangian method for semidefinite programming | 2010-12-03 | Paper |
| An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems | 2010-10-15 | Paper |
| On the implementation of a log-barrier progressive hedging method for multistage stochastic programs | 2010-04-21 | Paper |
| Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem | 2009-11-06 | Paper |
| A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation | 2009-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442492 | 2008-02-22 | Paper |
| An inexact primal-dual path following algorithm for convex quadratic SDP | 2007-09-10 | Paper |
| Solving Second Order Cone Programming via a Reduced Augmented System Approach | 2007-09-06 | Paper |
| Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming | 2007-08-27 | Paper |
| A modified SSOR preconditioner for sparse symmetric indefinite linear systems of equations | 2007-05-21 | Paper |
| Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems | 2007-03-05 | Paper |
| Computation of condition numbers for linear programming problems using Peña’s method | 2006-06-16 | Paper |
| An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems | 2005-11-11 | Paper |
| Efficient algorithms for the smallest enclosing ball problem | 2005-05-17 | Paper |
| Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems | 2005-02-23 | Paper |
| Block preconditioners for symmetric indefinite linear systems | 2005-01-12 | Paper |
| Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms | 2004-08-06 | Paper |
| Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming | 2004-07-01 | Paper |
| Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems | 2004-05-27 | Paper |
| Solving semidefinite-quadratic-linear programs using SDPT3 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429173 | 2003-09-24 | Paper |
| Fast iterative solution of large undrained soil-structure interaction problems | 2003-09-01 | Paper |
| An efficient diagonal preconditioner for finite element solution of Biot's consolidation equations | 2003-03-19 | Paper |
| Solving semidefinite-quadratic-linear programs using SDPT3 | 2003-02-01 | Paper |
| A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems | 2003-01-05 | Paper |
| A note on the calculation of step-lengths in interior-point methods for semidefinite programming | 2002-09-28 | Paper |
| Solving some large scale semidefinite programs via the conjugate residual method | 2002-04-23 | Paper |
| Computing the Sobolev regularity of refinable functions by the Arnoldi method | 2001-06-21 | Paper |
| Some new search directions for primal-dual interior point methods in semidefinite programming | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761957 | 2001-02-21 | Paper |
| SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 | 2000-12-06 | Paper |
| Hypersingular and finite part integrals in the boundary element method | 2000-10-16 | Paper |
| Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities | 2000-01-05 | Paper |
| The Kreiss Matrix Theorem on a General Complex Domain | 1999-11-24 | Paper |
| The Chebyshev Polynomials of a Matrix | 1999-05-18 | Paper |
| From Potential Theory to Matrix Iterations in Six Steps | 1998-09-21 | Paper |
| On the Nesterov--Todd Direction in Semidefinite Programming | 1998-09-21 | Paper |
| GMRES vs. Ideal GMRES | 1997-12-07 | Paper |
| Calculation of Pseudospectra by the Arnoldi Iteration | 1996-03-27 | Paper |
| Pseudozeros of polynomials and pseudospectra of companion matrices | 1994-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3988293 | 1992-06-28 | Paper |
| Wasserstein distributionally robust optimization and its tractable regularization formulations | N/A | Paper |
| Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems | N/A | Paper |
