| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6076152 | 2023-10-23 | Paper |
| Iteration Complexity of Fixed-Step Methods by Nesterov and Polyak for Convex Quadratic Functions | 2022-11-18 | Paper |
| Optimized convergence of stochastic gradient descent by weighted averaging | 2022-09-28 | Paper |
| On the existence of affine invariant descent directions | 2021-04-15 | Paper |
| Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting | 2020-03-25 | Paper |
| Optimization. Introduction to mathematical theory and methods | 2019-04-11 | Paper |
| The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction | 2018-05-02 | Paper |
| Calibration by optimization without using derivatives | 2017-06-21 | Paper |
| Simple examples for the failure of Newton's method with line search for strictly convex minimization | 2016-08-25 | Paper |
| Elementary Optimality Conditions for Nonlinear SDPs | 2016-04-26 | Paper |
| Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques | 2015-09-04 | Paper |
| New results on the cp-rank and related properties of co(mpletely )positive matrices | 2015-01-14 | Paper |
| A Symmetric Reduction of the NT Direction | 2014-09-26 | Paper |
| On the stable solution of large scale problems over the doubly nonnegative cone | 2014-08-29 | Paper |
| Least squares timestamp synchronization for local broadcast networks | 2013-10-24 | Paper |
| On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix | 2013-09-26 | Paper |
| On Nesterov's smooth Chebyshev–Rosenbrock function | 2013-06-24 | Paper |
| Burer's key assumption for semidefinite and doubly nonnegative relaxations | 2012-11-30 | Paper |
| High-accuracy solution of large-scale semidefinite programs | 2012-11-06 | Paper |
| A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm | 2012-08-08 | Paper |
| A self-concordance property for nonconvex semidefinite programming | 2011-09-20 | Paper |
| Quadratic factorization heuristics for copositive programming | 2011-06-08 | Paper |
| A note on Burer's copositive representation of mixed-binary QPs | 2010-10-04 | Paper |
| On the computation of \(C^*\) certificates | 2009-11-16 | Paper |
| An Augmented Primal-Dual Method for Linear Conic Programs | 2009-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442485 | 2008-02-22 | Paper |
| Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415753 | 2007-01-19 | Paper |
| Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints | 2006-05-30 | Paper |
| An extension of the positive real lemma to descriptor systems | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817264 | 2004-09-22 | Paper |
| A sensitivity result for semidefinite programs. | 2004-01-05 | Paper |
| Optimization | 2003-09-09 | Paper |
| An interior method for nonconvex semidefinite programs | 2003-03-12 | Paper |
| Optimal design of trusses under a nonconvex global buckling constraint | 2002-03-14 | Paper |
| Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs | 2001-11-26 | Paper |
| Solving the sum-of-ratios problem by an interior-point method | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517114 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517097 | 2000-11-22 | Paper |
| Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. | 2000-07-21 | Paper |
| The role of linear objective functions in barrier methods | 2000-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253467 | 1999-08-09 | Paper |
| Optimal Truss Design by Interior-Point Methods | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347847 | 1997-12-01 | Paper |
| A QMR-based interior-point algorithm for solving linear programs | 1997-07-23 | Paper |
| On self-concordant barrier functions for conic hulls and fractional programming | 1997-02-03 | Paper |
| A sufficient condition for self-concordance, with application to some classes of structured convex programming problems | 1996-09-18 | Paper |
| An infeasible-interior-point algorithm using projections onto a convex set | 1996-07-01 | Paper |
| A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems | 1996-06-02 | Paper |
| A Practical Interior-Point Method for Convex Programming | 1995-11-30 | Paper |
| An interior-point method for multifractional programs with convex constraints | 1995-07-03 | Paper |
| An interior-point method for fractional programs with convex constraints | 1995-05-15 | Paper |
| A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions | 1994-11-21 | Paper |
| Minisymposium 2 : Optimierung | 1994-09-21 | Paper |
| Optimal ellipsoidal approximations around the analytic center | 1994-08-10 | Paper |
| An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices | 1994-01-23 | Paper |
| Interior-point methods for convex programming | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995706 | 1992-09-17 | Paper |
| On the convergence of the method of analytic centers when applied to convex quadratic programs | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202850 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729615 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735039 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827797 | 1988-01-01 | Paper |
