| Publication | Date of Publication | Type |
|---|
| Scalable Approximate Optimal Diagonal Preconditioning | 2023-12-24 | Paper |
| Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness | 2023-10-26 | Paper |
| Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes | 2023-10-25 | Paper |
| Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms | 2023-08-23 | Paper |
| Learning to Pivot as a Smart Expert | 2023-08-16 | Paper |
| Blessing of High-Order Dimensionality: from Non-Convex to Convex Optimization for Sensor Network Localization | 2023-08-04 | Paper |
| Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods | 2023-06-30 | Paper |
| Simple and fast algorithm for binary integer and online linear programming | 2023-06-23 | Paper |
| A Riemannian Dimension-reduced Second Order Method with Application in Sensor Network Localization | 2023-04-20 | Paper |
| High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks | 2023-01-10 | Paper |
| Linear and Nonlinear Programming | 2023-01-04 | Paper |
| Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds | 2022-12-01 | Paper |
| MULTILEVEL MONTE CARLO SAMPLING ON HETEROGENEOUS COMPUTER ARCHITECTURES | 2022-11-24 | Paper |
| A Homogeneous Second-Order Descent Method for Nonconvex Optimization | 2022-11-15 | Paper |
| SOLNP+: A Derivative-Free Solver for Constrained Nonlinear Optimization | 2022-10-13 | Paper |
| Distributed Stochastic Optimization with Large Delays | 2022-09-26 | Paper |
| Optimization and operations research in mitigation of a pandemic | 2022-07-22 | Paper |
| Modern optimization theory and applications | 2022-03-21 | Paper |
| Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization | 2021-12-16 | Paper |
| Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs | 2021-10-20 | Paper |
| An ADMM-based interior-point method for large-scale linear programming | 2021-07-06 | Paper |
| On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods | 2021-02-15 | Paper |
| An Improved Analysis of LP-based Control for Revenue Management | 2021-01-26 | Paper |
| Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version | 2021-01-25 | Paper |
| Towards solving 2-TBSG efficiently | 2020-11-19 | Paper |
| Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs | 2020-06-10 | Paper |
| On the Efficiency of Random Permutation for ADMM and Coordinate Descent | 2020-04-30 | Paper |
| Erratum/correction to: ``On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering | 2020-04-01 | Paper |
| Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming | 2019-10-22 | Paper |
| Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary | 2019-10-22 | Paper |
| The simplex method is strongly polynomial for deterministic Markov decision processes | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633050 | 2019-05-02 | Paper |
| High-Dimensional Learning under ApproximateSparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks | 2019-03-01 | Paper |
| Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights | 2019-02-07 | Paper |
| On Doubly Positive Semidefinite Programming Relaxations | 2018-10-22 | Paper |
| Likelihood robust optimization for data-driven problems | 2018-10-10 | Paper |
| Dynamic Spectrum Management With the Competitive Market Model | 2018-07-09 | Paper |
| On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering | 2018-06-07 | Paper |
| Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model | 2018-06-05 | Paper |
| Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes | 2018-03-15 | Paper |
| A computation study on an integrated alternating direction method of multipliers for large scale optimization | 2018-02-09 | Paper |
| A one-phase interior point method for nonconvex optimization | 2018-01-09 | Paper |
| Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions | 2017-12-01 | Paper |
| Blind channel equalization and ε-approximation algorithms | 2017-09-08 | Paper |
| Optimization with few violated constraints for linear bounded error parameter estimation | 2017-06-20 | Paper |
| A Derandomized Algorithm for RP-ADMM with Symmetric Gauss-Seidel Method | 2017-05-23 | Paper |
| An accelerated interior point method whose running time depends only on A (extended abstract) | 2016-09-01 | Paper |
| A fixed point iterative approach to integer programming and its distributed computation | 2016-05-25 | Paper |
| The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent | 2016-02-23 | Paper |
| The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes | 2016-01-29 | Paper |
| The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty | 2015-08-28 | Paper |
| Linear and nonlinear programming | 2015-07-10 | Paper |
| A homogeneous interior-point algorithm for nonsymmetric convex conic optimization | 2015-04-16 | Paper |
| Linear operators and positive semidefiniteness of symmetric tensor spaces | 2015-03-26 | Paper |
| A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks | 2015-03-18 | Paper |
| Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization | 2015-02-09 | Paper |
| Competitive communication spectrum economy and equilibrium | 2015-01-27 | Paper |
| A Dynamic Near-Optimal Algorithm for Online Linear Programming | 2014-11-26 | Paper |
| Finding equitable convex partitions of points in a polygon efficiently | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921695 | 2014-10-13 | Paper |
| A Levenberg-Marquardt method with approximate projections | 2014-09-18 | Paper |
| Space tensor conic programming | 2014-09-18 | Paper |
| Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems | 2014-08-11 | Paper |
| Online Allocation Rules in Display Advertising | 2014-07-21 | Paper |
| Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact | 2014-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417692 | 2014-05-22 | Paper |
| Complexity of unconstrained \(L_2 - L_p\) minimization | 2014-02-25 | Paper |
| Selected Open Problems in Discrete Geometry and Optimization | 2013-09-13 | Paper |
| Conditions for Correct Sensor Network Localization Using SDP Relaxation | 2013-09-13 | Paper |
| Newsvendor optimization with limited distribution information | 2013-06-24 | Paper |
| Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems | 2013-04-12 | Paper |
| On stress matrices of \((d + 1)\)-lateration frameworks in general position | 2013-03-18 | Paper |
| On affine motions and bar frameworks in general position | 2013-01-21 | Paper |
| Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit | 2012-07-21 | Paper |
| The cubic spherical optimization problems | 2012-06-29 | Paper |
| Price of Correlations in Stochastic Optimization | 2012-06-18 | Paper |
| The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate | 2012-05-24 | Paper |
| Geometric rounding: A dependent randomized rounding scheme | 2012-04-04 | Paper |
| An interior-point path-following algorithm for computing a Leontief economy equilibrium | 2012-03-09 | Paper |
| A FPTAS for computing a symmetric leontief competitive economy equilibrium | 2012-02-22 | Paper |
| On Equilibrium Pricing as Convex Optimization | 2012-01-27 | Paper |
| A Dynamic Algorithm for Facilitated Charging of Plug-In Electric Vehicles | 2011-12-03 | Paper |
| Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems | 2011-11-17 | Paper |
| A note on the complexity of \(L _{p }\) minimization | 2011-11-07 | Paper |
| Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization | 2011-06-10 | Paper |
| A Unified Theorem on SDP Rank Reduction | 2011-04-27 | Paper |
| Stochastic Combinatorial Optimization with Controllable Risk Aversion Level | 2011-04-27 | Paper |
| Statistical ranking and combinatorial Hodge theory | 2011-03-31 | Paper |
| Universal Rigidity and Edge Sparsification for Sensor Network Localization | 2011-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3079667 | 2011-03-02 | Paper |
| Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations | 2010-09-06 | Paper |
| Toward the Universal Rigidity of General Frameworks | 2010-09-06 | Paper |
| Leontief economies encode nonzero sum two-player games | 2010-08-16 | Paper |
| A semidefinite programming approach to tensegrity theory and realizability of graphs | 2010-08-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Budget allocation in a competitive communication spectrum economy | 2010-04-24 | Paper |
| An edge-reduction algorithm for the vertex cover problem | 2009-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5324200 | 2009-08-03 | Paper |
| A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation | 2009-05-28 | Paper |
| Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization | 2009-05-27 | Paper |
| Algorithm 875 | 2008-12-21 | Paper |
| The complexity of equilibria: Hardness results for economies via a correspondence with games | 2008-12-12 | Paper |
| Linear and nonlinear programming. | 2008-08-07 | Paper |
| A path to the Arrow-Debreu competitive market equilibrium | 2008-01-21 | Paper |
| SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization | 2007-11-16 | Paper |
| Semidefinite Programming for Sensor Network and Graph Localization | 2007-09-24 | Paper |
| On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations | 2007-08-30 | Paper |
| Stochastic Combinatorial Optimization with Controllable Risk Aversion Level | 2007-08-28 | Paper |
| Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality | 2007-06-13 | Paper |
| Lot-sizing scheduling with batch setup times | 2007-05-15 | Paper |
| Approximation Algorithms for Metric Facility Location Problems | 2007-05-03 | Paper |
| On approximating complex quadratic optimization problems via semidefinite programming relaxations | 2007-04-19 | Paper |
| Theory of semidefinite programming for sensor network localization | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393827 | 2006-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494208 | 2006-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5492525 | 2006-10-13 | Paper |
| Improved complexity results on solving real-number linear feasibility problems | 2006-05-02 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem | 2005-11-11 | Paper |
| A New Complexity Result on Solving the Markov Decision Problem | 2005-11-11 | Paper |
| Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem | 2005-02-28 | Paper |
| On solving univariate sparse polynomials in logarithmic time | 2005-02-22 | Paper |
| Approximating the 2-catalog segmentation problem using semidefinite programming relaxations | 2005-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4822033 | 2004-10-25 | Paper |
| Improved approximations for max set splitting and max NAE SAT | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449171 | 2004-02-08 | Paper |
| New Results on Quadratic Minimization | 2004-01-19 | Paper |
| An approximation algorithm for scheduling two parallel machines with capacity constraints. | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411290 | 2003-07-07 | Paper |
| Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection | 2003-06-09 | Paper |
| A note on the maximization version of the multi-level facility location problem | 2003-04-02 | Paper |
| An improved rounding method and semidefinite programming relaxation for graph partition | 2002-12-01 | Paper |
| On approximation of max-vertex-cover | 2002-11-20 | Paper |
| Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems | 2002-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527186 | 2002-01-13 | Paper |
| On some interior-point algorithms for nonconvex quadratic optimization | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760093 | 2001-12-18 | Paper |
| Mixed linear and semidefinite programming for combinatorial and quadratic optimization | 2001-12-10 | Paper |
| Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming | 2001-11-26 | Paper |
| A .699-approximation algorithm for Max-Bisection. | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743961 | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743983 | 2001-09-18 | Paper |
| On Solving Fewnomials Over Intervals in Fewnomial Time | 2001-06-26 | Paper |
| On Smoothing Methods for the P0 Matrix Linear Complementarity Problem | 2001-03-19 | Paper |
| Approximating global quadratic optimization with convex quadratic constraints | 2001-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517108 | 2000-11-23 | Paper |
| Constrained logarithmic least squares in parameter estimation | 2000-10-17 | Paper |
| Bounded error parameter estimation: a sequential analytic center approach | 2000-10-17 | Paper |
| Convergence results of the analytic center estimator | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496017 | 2000-08-13 | Paper |
| Approximating quadratic programming with bound and quadratic constraints | 2000-07-21 | Paper |
| Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems | 2000-07-21 | Paper |
| On a homogeneous algorithm for the monotone complementarity problem | 2000-07-21 | Paper |
| Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization | 2000-03-19 | Paper |
| An Efficient Algorithm for Minimizing a Sum of p-Norms | 2000-03-19 | Paper |
| Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming | 1999-06-28 | Paper |
| On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities | 1999-06-24 | Paper |
| On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm | 1999-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227158 | 1999-05-26 | Paper |
| Predictor-corrector method for nonlinear complementarity problems | 1999-05-05 | Paper |
| A computational study of the homogeneous algorithm for large-scale convex optimization | 1999-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209438 | 1999-03-02 | Paper |
| On the complexity of approximating a KKT point of quadratic programming | 1998-09-07 | Paper |
| Approximation algorithms for quadratic programming | 1998-05-24 | Paper |
| Improved complexity using higher-order correctors for primal-dual Dikin affine scaling | 1998-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382667 | 1998-03-22 | Paper |
| On homogeneous and self-dual algorithms for LCP | 1998-02-19 | Paper |
| An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications | 1998-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247459 | 1998-01-01 | Paper |
| Complexity analysis of the analytic center cutting plane method that uses multiple cuts | 1997-11-25 | Paper |
| Combining Interior-Point and Pivoting Algorithms for Linear Programming | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353528 | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688508 | 1997-03-11 | Paper |
| A convergent algorithm for quantile regression with smoothing splines | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718701 | 1997-02-23 | Paper |
| An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods | 1997-02-23 | Paper |
| How partial knowledge helps to solve linear programs | 1997-02-04 | Paper |
| Minimal Adjustment Costs and the Optimal Choice of Inputs Under Time-of-Use Electricity Rates | 1997-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717969 | 1996-12-01 | Paper |
| Specially Structured Uncapacitated Facility Location Problems | 1996-10-27 | Paper |
| Condition numbers for polyhedra with real number data | 1996-10-20 | Paper |
| Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems | 1996-10-14 | Paper |
| On the Von Neumann Economic Growth Problem | 1996-09-15 | Paper |
| Combining binary search and Newton's method to compute real roots for a class of real functions | 1996-08-29 | Paper |
| Interior-point methods for nonlinear complementarity problems | 1996-07-31 | Paper |
| A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function | 1996-07-29 | Paper |
| A simplified homogeneous and self-dual linear programming algorithm and its implementation | 1996-07-01 | Paper |
| A lower bound on the number of iterations of long-step primal-dual linear programming algorithms | 1996-07-01 | Paper |
| Identifying an optimal basis in linear programming | 1996-07-01 | Paper |
| A generalized homogeneous and self-dual algorithm for linear programming | 1996-01-07 | Paper |
| A primal-dual interior point method whose running time depends only on the constraint matrix | 1996-01-01 | Paper |
| A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming | 1995-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840108 | 1995-07-18 | Paper |
| On the convergence of the iteration sequence in primal-dual interior- point methods | 1995-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323620 | 1995-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302066 | 1995-01-15 | Paper |
| Finding an interior point in the optimal face of linear programs | 1995-01-03 | Paper |
| An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm | 1994-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311911 | 1994-10-30 | Paper |
| Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm | 1994-05-30 | Paper |
| A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems | 1994-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142434 | 1994-05-19 | Paper |
| Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming | 1994-05-18 | Paper |
| An extension of the potential reduction algorithm for linear complementarity problems with some priority goals | 1994-04-27 | Paper |
| On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming | 1994-04-12 | Paper |
| On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP | 1994-04-12 | Paper |
| A Short-Cut Potential Reduction Algorithm for Linear Programming | 1994-01-02 | Paper |
| On the finite convergence of interior-point algorithms for linear programming | 1993-12-20 | Paper |
| Convergence behavior of interior-point algorithms | 1993-12-06 | Paper |
| A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming | 1993-08-22 | Paper |
| A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem | 1993-08-05 | Paper |
| A Potential Reduction Algorithm Allowing Column Generation | 1993-01-16 | Paper |
| An interior point potential reduction algorithm for the linear complementarity problem | 1993-01-16 | Paper |
| On affine scaling algorithms for nonconvex quadratic programming | 1992-12-17 | Paper |
| Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program | 1992-06-27 | Paper |
| Comparative analysis of affine scaling algorithms based on simplifying assumptions | 1992-06-27 | Paper |
| A class of linear complementarity problems solvable in polynomial time | 1992-06-25 | Paper |
| Containing and shrinking ellipsoids in the path-following algorithm | 1992-06-25 | Paper |
| Algorithms for the solution of quadratic knapsack problems | 1991-01-01 | Paper |
| An \(O(n^ 3L)\) potential reduction algorithm for linear programming | 1991-01-01 | Paper |
| A Centered Projective Algorithm for Linear Programming | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348711 | 1990-01-01 | Paper |
| Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202843 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202847 | 1990-01-01 | Paper |
| Interior-point algorithms for global optimization | 1990-01-01 | Paper |
| A ``build-down scheme for linear programming | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835303 | 1989-01-01 | Paper |
| Eliminating columns in the simplex method for linear programming | 1989-01-01 | Paper |
| An extension of Karmarkar's projective algorithm for convex quadratic programming | 1989-01-01 | Paper |
| Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming | 1987-01-01 | Paper |
| Karmarkar's algorithm and the ellipsoid method | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663454 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768069 | 1982-01-01 | Paper |
