Publication | Date of Publication | Type |
---|
A communication-efficient and privacy-aware distributed algorithm for sparse PCA | 2023-07-24 | Paper |
Local linear convergence of an ADMM-type splitting framework for equality constrained optimization | 2021-11-05 | Paper |
Block Algorithms with Augmented Rayleigh-Ritz Projections for Large-Scale Eigenpair Computation | 2020-10-27 | Paper |
Convergence of a class of stationary iterative methods for saddle point problems | 2019-07-19 | Paper |
An alternating direction and projection algorithm for structure-enforced matrix factorization | 2017-12-22 | Paper |
A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing | 2017-10-19 | Paper |
Trace-penalty minimization for large-scale eigenspace computation | 2017-08-16 | Paper |
Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation | 2017-05-29 | Paper |
Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format | 2017-04-03 | Paper |
An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations | 2015-08-18 | Paper |
An efficient augmented Lagrangian method with applications to total variation minimization | 2014-01-30 | Paper |
Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions | 2013-09-11 | Paper |
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm | 2013-04-10 | Paper |
An alternating direction algorithm for matrix completion with nonnegative factors | 2012-12-07 | Paper |
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing | 2011-10-28 | Paper |
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation | 2011-05-17 | Paper |
Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments | 2011-02-05 | Paper |
An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise | 2010-08-16 | Paper |
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction | 2009-10-19 | Paper |
A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration | 2009-10-19 | Paper |
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence | 2009-08-20 | Paper |
Dose-volume-based IMRT fluence optimization: a fast least-squares approach with differentia\-bility | 2008-02-21 | Paper |
Case studies for a first-order robust nonlinear programming formulation | 2007-10-16 | Paper |
General robust-optimization formulation for nonlinear programming | 2007-09-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5393833 | 2006-10-24 | Paper |
Interior-point gradient method for large-scale totally nonnegative least squares problems | 2006-02-08 | Paper |
A global optimization method for the molecular replacement problem in X-ray crystallography | 2005-06-14 | Paper |
Foreword: Special issue on mathematical programming in biology and medicine | 2005-02-24 | Paper |
Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. | 2005-01-11 | Paper |
Variationally constrained numerical solution of electrical impedance tomography | 2004-05-18 | Paper |
On Numerical Solution of the Maximum Volume Ellipsoid Problem | 2004-01-19 | Paper |
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs | 2003-10-29 | Paper |
Maximum stable set formulations and heuristics based on continuous optimization | 2003-07-13 | Paper |
Solving a class of semidefinite programs via nonlinear programming | 2002-12-01 | Paper |
Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds | 2002-10-08 | Paper |
Interior-point algorithms for semidefinite programming based on a nonlinear formulation | 2002-08-19 | Paper |
Selective search for global optimization of zero or small residual least-squares problems: A numerical study | 2002-08-11 | Paper |
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs | 2002-04-23 | Paper |
Local behavior of the Newton method on two equivalent systems from linear programming | 2002-04-11 | Paper |
On convergence of minimization methods: Attraction, repulsion, and selection | 2001-02-18 | Paper |
User'S guide To Lipsol linear-programming interior point solvers V0.4 | 2000-09-14 | Paper |
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming | 1999-06-03 | Paper |
Solving large-scale linear programs by interior-point methods under the Matlab∗Environment† | 1999-02-02 | Paper |
On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming | 1998-05-12 | Paper |
A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence | 1997-01-19 | Paper |
On the convergence rate of Newton interior-point methods in the absence of strict complementarity | 1996-12-19 | Paper |
A superquadratic infeasible-interior-point method for linear complementarity problems | 1996-10-13 | Paper |
On the formulation and theory of the Newton interior-point method for nonlinear programming | 1996-08-22 | Paper |
The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method | 1996-06-04 | Paper |
Superlinear convergence of infeasible-interior-point methods for linear programming | 1995-09-26 | Paper |
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms | 1995-05-28 | Paper |
On the convergence of the iteration sequence in primal-dual interior- point methods | 1995-05-14 | Paper |
Modified predictor-corrector algorithm for locating weighted centers in linear programming | 1994-10-30 | Paper |
Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited | 1994-07-25 | Paper |
A Study of Indicators for Identifying Zero Variables in Interior-Point Methods | 1994-05-18 | Paper |
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem | 1994-05-18 | Paper |
Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems | 1994-04-27 | Paper |
A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming | 1993-08-22 | Paper |
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems | 1993-08-11 | Paper |
A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming | 1993-06-29 | Paper |
An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization | 1993-01-16 | Paper |
On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms | 1993-01-16 | Paper |
Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization | 1992-10-06 | Paper |
An optimal-basis identification technique for interior-point linear programming algorithms | 1992-06-25 | Paper |
Cubically convergent method for locating a nearby vertex in linear programming | 1990-01-01 | Paper |
A new quasi-Newton algorithm | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3493073 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3804075 | 1988-01-01 | Paper |
Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family | 1988-01-01 | Paper |
The contraction number of a multigrid method with mesh ratio two for solving model problems | 1986-01-01 | Paper |
Solution of two‐point boundary value problems using splines | 1986-01-01 | Paper |