| Publication | Date of Publication | Type |
|---|
| Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments | 2024-11-20 | Paper |
| Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization | 2024-09-02 | Paper |
| Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization | 2023-12-18 | Paper |
| Improvements to Quantum Interior Point Method for Linear Optimization | 2023-10-11 | Paper |
| On relaxations of the max $k$-cut problem formulations | 2023-08-02 | Paper |
| An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers | 2023-07-26 | Paper |
| EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity | 2023-07-12 | Paper |
| Sensitivity Analysis In Linear And Convex Quadratic Optimization: Invariant Active Constraint Set And Invariant Set Intervals* | 2023-05-05 | Paper |
| Book Reviews | 2023-04-21 | Paper |
| Examples with decreasing largest inscribed ball for deterministic rescaling algorithms | 2023-03-20 | Paper |
| On the identification of the optimal partition for semidefinite optimization | 2023-03-15 | Paper |
| Correction | 2023-03-15 | Paper |
| Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments | 2023-02-01 | Paper |
| On Semidefinite Representations of Second-order Conic Optimization Problems | 2023-01-27 | Paper |
| On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization | 2023-01-09 | Paper |
| Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem | 2022-11-29 | Paper |
| Discrete multi-load truss sizing optimization: model analysis and computational experiments | 2022-08-26 | Paper |
| Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems | 2022-04-22 | Paper |
| On the sensitivity of the optimal partition for parametric second-order conic optimization | 2021-09-29 | Paper |
| Characterization of QUBO reformulations for the maximum $k$-colorable subgraph problem | 2021-01-23 | Paper |
| On pathological disjunctions and redundant disjunctive conic cuts | 2020-02-10 | Paper |
| A rounding procedure for semidefinite optimization | 2020-02-10 | Paper |
| Parametric analysis of semidefinite optimization | 2020-01-13 | Paper |
| Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity | 2019-10-02 | Paper |
| The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight | 2019-09-09 | Paper |
| On computing the nonlinearity interval in parametric semidefinite optimization | 2019-08-27 | Paper |
| A novel unified approach to invariance conditions for a linear dynamical system | 2019-03-28 | Paper |
| Invariance preserving discretization methods of dynamical systems | 2018-12-20 | Paper |
| A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization | 2018-05-24 | Paper |
| Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint | 2018-05-03 | Paper |
| Obituary: András Prékopa (1929--2016) | 2018-02-16 | Paper |
| A polynomial primal-dual affine scaling algorithm for symmetric conic optimization | 2017-04-21 | Paper |
| Invariance Conditions for Nonlinear Dynamical Systems | 2017-01-27 | Paper |
| An analogue of the Klee-Walkup result for sonnevend's curvature of the central path | 2016-05-27 | Paper |
| Self-Regular Interior-Point Methods for Semidefinite Optimization | 2016-04-26 | Paper |
| Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron | 2016-03-09 | Paper |
| A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization | 2016-01-05 | Paper |
| Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications | 2015-12-03 | Paper |
| The Duality Between the Perceptron Algorithm and the von Neumann Algorithm | 2015-02-06 | Paper |
| On the Identification of the Optimal Partition of Second Order Cone Optimization Problems | 2014-06-19 | Paper |
| A Novel Unified Approach to Invariance for a Dynamical System | 2014-05-20 | Paper |
| On families of quadratic surfaces having fixed intersections with two hyperplanes | 2014-04-10 | Paper |
| Polynomial interior point algorithms for general linear complementarity problems | 2013-12-11 | Paper |
| Optimizing the gVERSE RF pulse sequence: an evaluation of two competitive software algorithms | 2013-12-11 | Paper |
| Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes | 2013-11-28 | Paper |
| Diameter and Curvature: Intriguing Analogies | 2013-06-28 | Paper |
| Multi-start approach for an integer determinant maximization problem | 2013-04-22 | Paper |
| Convex approximations in stochastic programming by semidefinite programming | 2013-01-15 | Paper |
| On the volumetric path | 2012-11-30 | Paper |
| Global routing in VLSI design: algorithms, theory, and computational practice | 2012-07-02 | Paper |
| An interior point constraint generation algorithm for semi-infinite optimization with health-care application | 2012-03-26 | Paper |
| Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions | 2011-04-27 | Paper |
| A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity | 2011-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3079181 | 2011-03-01 | Paper |
| A polynomial path-following interior point algorithm for general linear complementarity problems | 2010-08-23 | Paper |
| Interior Point Methods for Nonlinear Optimization | 2010-06-21 | Paper |
| Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes | 2010-06-04 | Paper |
| On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization | 2010-05-21 | Paper |
| Bi-parametric convex quadratic optimization | 2010-05-21 | Paper |
| Efficient preprocessing for VLSI optimization problems | 2010-04-28 | Paper |
| Self-adaptive support vector machines: modelling and experiments | 2009-08-04 | Paper |
| Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design | 2009-07-06 | Paper |
| A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION | 2009-06-30 | Paper |
| A confidence voting process for ranking problems based on support vector machines | 2009-06-25 | Paper |
| New stopping criteria for detecting infeasibility in conic optimization | 2009-06-17 | Paper |
| A continuous \(d\)-step conjecture for polytopes | 2009-05-13 | Paper |
| EP theorem for dual linear complementarity problems | 2009-05-05 | Paper |
| Packing trees in communication networks | 2009-05-04 | Paper |
| A redundant Klee-Minty construction with all the redundant constraints touching the feasible region | 2009-03-04 | Paper |
| Optimizing Teardrop, an MRI sampling trajectory | 2009-01-16 | Paper |
| On Mehrotra-Type Predictor-Corrector Algorithms | 2008-12-05 | Paper |
| Mehrotra-type predictor-corrector algorithm revisited | 2008-11-19 | Paper |
| Active constraint set invariancy sensitivity analysis in linear optimization | 2008-09-23 | Paper |
| The colourful feasibility problem | 2008-09-10 | Paper |
| On routing in VLSI design and communication networks | 2008-09-10 | Paper |
| A simpler and tighter redundant Klee-Minty construction | 2008-09-04 | Paper |
| Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems | 2008-09-04 | Paper |
| Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization | 2008-09-03 | Paper |
| Polytopes and arrangements: diameter and curvature | 2008-08-06 | Paper |
| How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds | 2008-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446957 | 2008-03-06 | Paper |
| New complexity analysis of IIPMs for linear optimization based on a specific self-regular function | 2007-11-23 | Paper |
| Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization | 2007-09-10 | Paper |
| A Survey of the S-Lemma | 2007-09-07 | Paper |
| Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms | 2007-05-30 | Paper |
| Generalized support set invariancy sensitivity analysis in linear optimization | 2007-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428840 | 2007-03-29 | Paper |
| The central path visits all the vertices of the Klee–Minty cube | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The complexity of self-regular proximity based infeasible IPMs | 2006-09-28 | Paper |
| Colourful simplicial depth | 2006-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717954 | 2006-01-13 | Paper |
| Sensitivity analysis in linear optimization: invariant support set intervals | 2005-11-04 | Paper |
| Interior Point Methods for Linear Optimization | 2005-11-03 | Paper |
| Rapid, embeddable design method for spiral magnetic resonance image reconstruction resampling kernels | 2005-09-27 | Paper |
| A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function | 2005-09-16 | Paper |
| An adaptive self-regular proximity-based large-update IPM for LO | 2005-08-25 | Paper |
| Sensitivity analysis in convex quadratic optimization: invariant support set interval | 2005-08-25 | Paper |
| On self-regular IPMs (with comments and rejoinder) | 2005-04-04 | Paper |
| Conic formulation for \(l_p\)-norm optimization | 2005-01-17 | Paper |
| A dynamic large-update primal‐dual interior-point method for linear optimization | 2004-03-22 | Paper |
| On implementing a primal-dual interior-point method for conic quadratic optimization | 2003-10-29 | Paper |
| Notes on Duality in Second Order and p -Order Cone Optimization | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355914 | 2003-05-22 | Paper |
| Reloading nuclear reactor fuel using mixed-integer nonlinear optimization | 2003-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791754 | 2003-02-03 | Paper |
| Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities | 2003-01-05 | Paper |
| Self-regular functions and new search directions for linear and semidefinite optimization | 2002-12-01 | Paper |
| A new class of polynomial primal-dual methods for linear and semidefinite optimization | 2002-11-20 | Paper |
| A new approach to optimizing energy systems | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762524 | 2002-06-16 | Paper |
| Pivot versus interior point methods: Pros and cons | 2002-05-28 | Paper |
| A new and efficient large-update interior-point method for linear optimization | 2002-02-24 | Paper |
| A homogenized cutting plane method to solve the convex feasibility problem. | 2001-12-13 | Paper |
| New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction | 2001-12-05 | Paper |
| The role of the pivot technique in the proof of some fundamental theorems of linear algebra. | 2001-11-12 | Paper |
| New complexity analysis of the primal-dual Newton method for linear optimization | 2001-06-14 | Paper |
| On copositive programming and standard quadratic optimization problems | 2001-04-17 | Paper |
| On the existence of a short admissible pivot sequence for feasibility and linear optimization problems | 2001-04-01 | Paper |
| A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems | 2001-03-19 | Paper |
| A scaled Gauss--Newton primal-dual search direction for semidefinite optimization | 2001-03-19 | Paper |
| An easy way to teach interior-point methods. | 2001-01-01 | Paper |
| Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517100 | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496018 | 2000-10-23 | Paper |
| On maximization of quadratic form over intersection of ellipsoids with common center | 2000-06-26 | Paper |
| The finite criss-cross method for hyperbolic programming | 2000-04-09 | Paper |
| Note on a paper of Broyden | 2000-03-19 | Paper |
| Basis- and partition identification for quadratic programming and linear complementarity problems | 2000-01-30 | Paper |
| A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm | 1999-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254537 | 1999-06-29 | Paper |
| Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions | 1999-06-29 | Paper |
| Polynomial primal-dual affine scaling algorithms in semidefinite programming | 1999-05-05 | Paper |
| Logarithmic Barrier Decomposition Methods for Semi-infinite Programming | 1999-05-05 | Paper |
| Sensitivity analysis in linear programming: Just be careful! | 1999-02-28 | Paper |
| On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395415 | 1999-01-19 | Paper |
| A nonconvex weighted potential function for polynomial target following methods | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840328 | 1998-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400648 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398364 | 1998-07-19 | Paper |
| Copositive realxation for genera quadratic programming | 1998-06-02 | Paper |
| Criss-cross methods: A fresh view on pivot algorithms | 1998-06-01 | Paper |
| Computing Maximum Likelihood Estimators of Convex Density Functions | 1998-05-12 | Paper |
| Improved complexity using higher-order correctors for primal-dual Dikin affine scaling | 1998-04-05 | Paper |
| Initialization in semidefinite programming via a self-dual skew-symmetric embedding | 1998-03-02 | Paper |
| Inverse barriers and CES-functions in linear programming | 1998-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362984 | 1997-11-13 | Paper |
| Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347843 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347841 | 1997-08-11 | Paper |
| Method of approximate centers for semi-definite programming | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343737 | 1997-07-06 | Paper |
| Optimization of nuclear reactor reloading patterns | 1997-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339096 | 1997-06-04 | Paper |
| Inverse barrier methods for linear programming | 1997-03-16 | Paper |
| A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems | 1997-03-11 | Paper |
| A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming | 1997-03-11 | Paper |
| Primal-dual target-following algorithms for linear programming | 1996-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895331 | 1996-10-14 | Paper |
| A sufficient condition for self-concordance, with application to some classes of structured convex programming problems | 1996-09-18 | Paper |
| A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming | 1996-08-05 | Paper |
| A logarithmic barrier cutting plane method for convex programming | 1996-05-02 | Paper |
| Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4855977 | 1995-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840104 | 1995-08-14 | Paper |
| Some generalizations of the criss-cross method for quadratic programming | 1995-06-11 | Paper |
| The theory of linear programming:skew symmetric self-dual problems and the central path* | 1995-04-20 | Paper |
| Pseudoconvex optimization for a special problem of paint industry | 1995-01-12 | Paper |
| Primal-dual algorithms for linear programming based on the logarithmic barrier method | 1994-12-04 | Paper |
| A Monotonic Build-Up Simplex Algorithm for Linear Programming | 1994-09-15 | Paper |
| On the classical logarithmic barrier function method for a class of smooth convex programming problems | 1994-04-27 | Paper |
| Degeneracy in interior point methods for linear programming: A survey | 1994-02-24 | Paper |
| Pivot rules for linear programming: A survey on recent theoretical developments | 1994-02-07 | Paper |
| A long-step barrier method for convex quadratic programming | 1993-12-06 | Paper |
| The linear complementarity problem, sufficient matrices, and the criss- cross method | 1993-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5286129 | 1993-06-29 | Paper |
| The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method | 1993-05-18 | Paper |
| LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS | 1993-01-16 | Paper |
| A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems | 1993-01-16 | Paper |
| A build-up variant of the logarithmic barrier method for LP | 1993-01-16 | Paper |
| A Polynomial Method of Weighted Centers for Convex Quadratic Programming | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4710542 | 1992-06-25 | Paper |
| A potential-reduction variant of Renegar's short-step path-following method for linear programming | 1991-01-01 | Paper |
| The role of pivoting in proving some fundamental theorems of linear algebra | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360010 | 1990-01-01 | Paper |
| Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids | 1989-01-01 | Paper |
| Variants of the Hungarian method for solving linear programming problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3198693 | 1989-01-01 | Paper |
| Linearly constrained estimation by mathematical programming | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753743 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750719 | 1989-01-01 | Paper |
| A finite crisscross method for oriented matroids | 1987-01-01 | Paper |
| A new algorithm for quadratic programming | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3831021 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783068 | 1987-01-01 | Paper |
| Smoothing empirical functions by \(\ell _ p\) programming | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777806 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768919 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768671 | 1986-01-01 | Paper |
| On \(\ell_ p\) programming | 1985-01-01 | Paper |
| A convergent criss-cross method | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749071 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703176 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3706831 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710325 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929409 | 1980-01-01 | Paper |
