| Publication | Date of Publication | Type |
|---|
Efficient reinforcement learning with impaired observability: learning to act with delayed and missing state observations
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Data-driven aerodynamic shape design with distributionally robust optimization approaches
Computer Methods in Applied Mechanics and Engineering | 2024-08-15 | Paper |
Technical note -- An improved analysis of LP-based control for revenue management
Operations Research | 2024-07-29 | Paper |
A Riemannian dimension-reduced second-order method with application in sensor network localization
SIAM Journal on Scientific Computing | 2024-06-26 | Paper |
Adaptive discrete phase retrieval
| 2024-05-14 | Paper |
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
Naval Research Logistics | 2023-10-25 | Paper |
Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
Games and Economic Behavior | 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
Mathematical Programming. Series A. Series B | 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
Operations Research | 2023-01-10 | Paper |
Linear and Nonlinear Programming
International Series in Operations Research & Management Science | 2023-01-04 | Paper |
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
Operations Research | 2022-12-01 | Paper |
MULTILEVEL MONTE CARLO SAMPLING ON HETEROGENEOUS COMPUTER ARCHITECTURES
International Journal for Uncertainty Quantification | 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
Mathematics of Operations Research | 2022-09-26 | Paper |
Optimization and operations research in mitigation of a pandemic
Journal of the Operations Research Society of China | 2022-07-22 | Paper |
Modern optimization theory and applications
SCIENTIA SINICA Mathematica | 2022-03-21 | Paper |
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
Mathematical Programming Computation | 2021-12-16 | Paper |
Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
An ADMM-based interior-point method for large-scale linear programming
Optimization Methods & Software | 2021-07-06 | Paper |
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
Mathematical Programming. Series A. Series B | 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
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
Towards solving 2-TBSG efficiently
Optimization Methods & Software | 2020-11-19 | Paper |
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Mathematical Programming. Series A. Series B | 2020-06-10 | Paper |
On the efficiency of random permutation for ADMM and coordinate descent
Mathematics of Operations Research | 2020-04-30 | Paper |
Erratum/correction to: ``On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
Theoretical Computer Science | 2020-04-01 | Paper |
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
The simplex method is strongly polynomial for deterministic Markov decision processes
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Approximation hardness for a class of sparse optimization problems
| 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
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
On doubly positive semidefinite programming relaxations
Journal of Computational Mathematics | 2018-10-22 | Paper |
Likelihood robust optimization for data-driven problems
Computational Management Science | 2018-10-10 | Paper |
Dynamic Spectrum Management With the Competitive Market Model
IEEE Transactions on Signal Processing | 2018-07-09 | Paper |
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
Theoretical Computer Science | 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
Optimization Letters | 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
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
Blind channel equalization and ε-approximation algorithms
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
Optimization with few violated constraints for linear bounded error parameter estimation
IEEE Transactions on Automatic Control | 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)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
A fixed point iterative approach to integer programming and its distributed computation
Fixed Point Theory and Applications | 2016-05-25 | Paper |
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Mathematical Programming. Series A. Series B | 2016-02-23 | Paper |
The simplex method is strongly polynomial for deterministic Markov decision processes
Mathematics of Operations Research | 2016-01-29 | Paper |
The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty
Operations Research | 2015-08-28 | Paper |
Linear and nonlinear programming
International Series in Operations Research & Management Science | 2015-07-10 | Paper |
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Linear operators and positive semidefiniteness of symmetric tensor spaces
Science China. Mathematics | 2015-03-26 | Paper |
A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks
Journal of Theoretical Biology | 2015-03-18 | Paper |
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
Competitive communication spectrum economy and equilibrium
Journal of the Operations Research Society of China | 2015-01-27 | Paper |
A dynamic near-optimal algorithm for online linear programming
Operations Research | 2014-11-26 | Paper |
Finding equitable convex partitions of points in a polygon efficiently
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Theory of semidefinite programming for sensor network localization
| 2014-10-13 | Paper |
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
| 2014-10-13 | Paper |
Space tensor conic programming
Computational Optimization and Applications | 2014-09-18 | Paper |
A Levenberg-Marquardt method with approximate projections
Computational Optimization and Applications | 2014-09-18 | Paper |
Close the gaps: a learning-while-doing algorithm for single-product revenue management problems
Operations Research | 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
Operations Research | 2014-06-26 | Paper |
Correlation robust stochastic optimization
| 2014-05-22 | Paper |
Complexity of unconstrained \(L_2 - L_p\) minimization
Mathematical Programming. Series A. Series B | 2014-02-25 | Paper |
Conditions for correct sensor network localization using SDP relaxation
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Selected open problems in discrete geometry and optimization
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Newsvendor optimization with limited distribution information
Optimization Methods & Software | 2013-06-24 | Paper |
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
Mathematical Programming Computation | 2013-04-12 | Paper |
On stress matrices of \((d + 1)\)-lateration frameworks in general position
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
On affine motions and bar frameworks in general position
Linear Algebra and its Applications | 2013-01-21 | Paper |
Fast and near-optimal matrix completion via randomized basis pursuit
| 2012-07-21 | Paper |
The cubic spherical optimization problems
Mathematics of Computation | 2012-06-29 | Paper |
Price of correlations in stochastic optimization
Operations Research | 2012-06-18 | Paper |
The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
Mathematics of Operations Research | 2012-05-24 | Paper |
Geometric rounding: A dependent randomized rounding scheme
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
An interior-point path-following algorithm for computing a Leontief economy equilibrium
Computational Optimization and Applications | 2012-03-09 | Paper |
A FPTAS for computing a symmetric leontief competitive economy equilibrium
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
On Equilibrium Pricing as Convex Optimization
Journal of Computational Mathematics | 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
Operations Research | 2011-11-17 | Paper |
A note on the complexity of \(L _{p }\) minimization
Mathematical Programming. Series A. Series B | 2011-11-07 | Paper |
Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
SIAM Journal on Scientific Computing | 2011-06-10 | Paper |
A Unified Theorem on SDP Rank Reduction
Mathematics of Operations Research | 2011-04-27 | Paper |
Stochastic combinatorial optimization with controllable risk aversion level
Mathematics of Operations Research | 2011-04-27 | Paper |
Statistical ranking and combinatorial Hodge theory
Mathematical Programming. Series A. Series B | 2011-03-31 | Paper |
Universal Rigidity and Edge Sparsification for Sensor Network Localization
SIAM Journal on Optimization | 2011-03-21 | Paper |
Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems
| 2011-03-02 | Paper |
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
SIAM Journal on Optimization | 2010-09-06 | Paper |
Toward the Universal Rigidity of General Frameworks
| 2010-09-06 | Paper |
Leontief economies encode nonzero sum two-player games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A semidefinite programming approach to tensegrity theory and realizability of graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
An improved algorithm for approximating the radii of point sets
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Budget allocation in a competitive communication spectrum economy
EURASIP Journal on Advances in Signal Processing | 2010-04-24 | Paper |
An edge-reduction algorithm for the vertex cover problem
Operations Research Letters | 2009-08-14 | Paper |
Solving min-max multi-depot vehicle routing problem
| 2009-08-03 | Paper |
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
SIAM Journal on Scientific Computing | 2009-05-28 | Paper |
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
SIAM Journal on Optimization | 2009-05-27 | Paper |
Algorithm 875
ACM Transactions on Mathematical Software | 2008-12-21 | Paper |
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science | 2008-12-12 | Paper |
Linear and nonlinear programming.
International Series in Operations Research & Management Science | 2008-08-07 | Paper |
A path to the Arrow-Debreu competitive market equilibrium
Mathematical Programming. Series A. Series B | 2008-01-21 | Paper |
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
SIAM Journal on Optimization | 2007-11-16 | Paper |
Semidefinite Programming for Sensor Network and Graph Localization
Robust Optimization-Directed Design | 2007-09-24 | Paper |
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
Theoretical Computer Science | 2007-06-13 | Paper |
Lot-sizing scheduling with batch setup times
Journal of Scheduling | 2007-05-15 | Paper |
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing | 2007-05-03 | Paper |
On approximating complex quadratic optimization problems via semidefinite programming relaxations
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Theory of semidefinite programming for sensor network localization
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
| 2006-10-24 | Paper |
scientific article; zbMATH DE number 5064928 (Why is no real title available?)
| 2006-10-17 | Paper |
Disciplined convex programming
| 2006-10-13 | Paper |
Improved complexity results on solving real-number linear feasibility problems
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
A New Complexity Result on Solving the Markov Decision Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity | 2005-02-22 | Paper |
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
Optimization Methods & Software | 2005-02-18 | Paper |
scientific article; zbMATH DE number 2109417 (Why is no real title available?)
| 2004-10-25 | Paper |
Improved approximations for max set splitting and max NAE SAT
Discrete Applied Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2038706 (Why is no real title available?)
| 2004-02-08 | Paper |
New Results on Quadratic Minimization
SIAM Journal on Optimization | 2004-01-19 | Paper |
An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discrete Applied Mathematics | 2003-09-22 | Paper |
scientific article; zbMATH DE number 1947060 (Why is no real title available?)
| 2003-07-07 | Paper |
Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
Journal of Global Optimization | 2003-06-09 | Paper |
A note on the maximization version of the multi-level facility location problem
Operations Research Letters | 2003-04-02 | Paper |
An improved rounding method and semidefinite programming relaxation for graph partition
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
On approximation of max-vertex-cover
European Journal of Operational Research | 2002-11-20 | Paper |
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Mathematical Programming. Series A. Series B | 2002-02-12 | Paper |
scientific article; zbMATH DE number 1560335 (Why is no real title available?)
| 2002-01-13 | Paper |
On some interior-point algorithms for nonconvex quadratic optimization
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation
| 2001-12-18 | Paper |
Mixed linear and semidefinite programming for combinatorial and quadratic optimization
Optimization Methods & Software | 2001-12-10 | Paper |
Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
Mathematics of Operations Research | 2001-11-26 | Paper |
A .699-approximation algorithm for Max-Bisection.
Mathematical Programming. Series A. Series B | 2001-11-01 | Paper |
Average performance of a self-dual interior point algorithm for linear programming
| 2001-09-18 | Paper |
Translational cuts for convex minimization
| 2001-09-18 | Paper |
On Solving Fewnomials Over Intervals in Fewnomial Time
| 2001-06-26 | Paper |
On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
SIAM Journal on Optimization | 2001-03-19 | Paper |
Approximating global quadratic optimization with convex quadratic constraints
Journal of Global Optimization | 2001-01-30 | Paper |
scientific article; zbMATH DE number 1534299 (Why is no real title available?)
| 2000-11-23 | Paper |
Constrained logarithmic least squares in parameter estimation
IEEE Transactions on Automatic Control | 2000-10-17 | Paper |
Bounded error parameter estimation: a sequential analytic center approach
IEEE Transactions on Automatic Control | 2000-10-17 | Paper |
Convergence results of the analytic center estimator
IEEE Transactions on Automatic Control | 2000-10-17 | Paper |
scientific article; zbMATH DE number 1489800 (Why is no real title available?)
| 2000-08-13 | Paper |
On a homogeneous algorithm for the monotone complementarity problem
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
Approximating quadratic programming with bound and quadratic constraints
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
SIAM Journal on Optimization | 2000-03-19 | Paper |
An Efficient Algorithm for Minimizing a Sum of p-Norms
SIAM Journal on Optimization | 2000-03-19 | Paper |
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1999-06-28 | Paper |
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
SIAM Journal on Control and Optimization | 1999-06-24 | Paper |
On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
Annals of Operations Research | 1999-06-10 | Paper |
scientific article; zbMATH DE number 1254127 (Why is no real title available?)
| 1999-05-26 | Paper |
Predictor-corrector method for nonlinear complementarity problems
Acta Mathematicae Applicatae Sinica. English Series | 1999-05-05 | Paper |
A computational study of the homogeneous algorithm for large-scale convex optimization
Computational Optimization and Applications | 1999-03-09 | Paper |
scientific article; zbMATH DE number 1203224 (Why is no real title available?)
| 1999-03-02 | Paper |
On the complexity of approximating a KKT point of quadratic programming
Mathematical Programming. Series A. Series B | 1998-09-07 | Paper |
Approximation algorithms for quadratic programming
Journal of Combinatorial Optimization | 1998-05-24 | Paper |
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
Mathematical Programming. Series A. Series B | 1998-04-05 | Paper |
scientific article; zbMATH DE number 1131479 (Why is no real title available?)
| 1998-03-22 | Paper |
On homogeneous and self-dual algorithms for LCP
Mathematical Programming. Series A. Series B | 1998-02-19 | Paper |
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
SIAM Journal on Optimization | 1998-02-10 | Paper |
scientific article; zbMATH DE number 1302192 (Why is no real title available?)
| 1998-01-01 | Paper |
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
Combining Interior-Point and Pivoting Algorithms for Linear Programming
Management Science | 1997-10-28 | Paper |
scientific article; zbMATH DE number 1059215 (Why is no real title available?)
| 1997-09-10 | Paper |
scientific article; zbMATH DE number 970357 (Why is no real title available?)
| 1997-03-11 | Paper |
A convergent algorithm for quantile regression with smoothing splines
Computational Statistics and Data Analysis | 1997-02-28 | Paper |
An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
SIAM Journal on Optimization | 1997-02-23 | Paper |
scientific article; zbMATH DE number 954673 (Why is no real title available?)
| 1997-02-23 | Paper |
How partial knowledge helps to solve linear programs
Journal of Complexity | 1997-02-04 | Paper |
Minimal Adjustment Costs and the Optimal Choice of Inputs Under Time-of-Use Electricity Rates
Management Science | 1997-01-06 | Paper |
scientific article; zbMATH DE number 953048 (Why is no real title available?)
| 1996-12-01 | Paper |
Specially Structured Uncapacitated Facility Location Problems
Operations Research | 1996-10-27 | Paper |
Condition numbers for polyhedra with real number data
Operations Research Letters | 1996-10-20 | Paper |
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
SIAM Journal on Optimization | 1996-10-14 | Paper |
On the Von Neumann Economic Growth Problem
Mathematics of Operations Research | 1996-09-15 | Paper |
Combining binary search and Newton's method to compute real roots for a class of real functions
Journal of Complexity | 1996-08-29 | Paper |
Interior-point methods for nonlinear complementarity problems
Journal of Optimization Theory and Applications | 1996-07-31 | Paper |
A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
SIAM Journal on Optimization | 1996-07-29 | Paper |
A simplified homogeneous and self-dual linear programming algorithm and its implementation
Annals of Operations Research | 1996-07-01 | Paper |
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
Annals of Operations Research | 1996-07-01 | Paper |
Identifying an optimal basis in linear programming
Annals of Operations Research | 1996-07-01 | Paper |
A generalized homogeneous and self-dual algorithm for linear programming
Operations Research Letters | 1996-01-07 | Paper |
A primal-dual interior point method whose running time depends only on the constraint matrix
Mathematical Programming. Series A. Series B | 1996-01-01 | Paper |
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1995-07-31 | Paper |
scientific article; zbMATH DE number 776088 (Why is no real title available?)
| 1995-07-18 | Paper |
On the convergence of the iteration sequence in primal-dual interior- point methods
Mathematical Programming. Series A. Series B | 1995-05-14 | Paper |
scientific article; zbMATH DE number 724220 (Why is no real title available?)
| 1995-02-23 | Paper |
scientific article; zbMATH DE number 617926 (Why is no real title available?)
| 1995-01-15 | Paper |
Finding an interior point in the optimal face of linear programs
Mathematical Programming. Series A. Series B | 1995-01-03 | Paper |
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Mathematics of Operations Research | 1994-11-17 | Paper |
scientific article; zbMATH DE number 679864 (Why is no real title available?)
| 1994-10-30 | Paper |
Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
SIAM Journal on Matrix Analysis and Applications | 1994-05-30 | Paper |
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
SIAM Journal on Optimization | 1994-05-30 | Paper |
scientific article; zbMATH DE number 446510 (Why is no real title available?)
| 1994-05-19 | Paper |
Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1994-05-18 | Paper |
An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
Linear Algebra and its Applications | 1994-04-27 | Paper |
On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
Mathematical Programming. Series A. Series B | 1994-04-12 | Paper |
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1994-04-12 | Paper |
A Short-Cut Potential Reduction Algorithm for Linear Programming
Management Science | 1994-01-02 | Paper |
On the finite convergence of interior-point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1993-12-20 | Paper |
Convergence behavior of interior-point algorithms
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
Mathematical Programming. Series A. Series B | 1993-08-22 | Paper |
A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
Mathematics of Operations Research | 1993-08-05 | Paper |
A Potential Reduction Algorithm Allowing Column Generation
SIAM Journal on Optimization | 1993-01-16 | Paper |
An interior point potential reduction algorithm for the linear complementarity problem
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
On affine scaling algorithms for nonconvex quadratic programming
Mathematical Programming. Series A. Series B | 1992-12-17 | Paper |
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
Operations Research Letters | 1992-06-27 | Paper |
Comparative analysis of affine scaling algorithms based on simplifying assumptions
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
A class of linear complementarity problems solvable in polynomial time
Linear Algebra and its Applications | 1992-06-25 | Paper |
Containing and shrinking ellipsoids in the path-following algorithm
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
An \(O(n^ 3L)\) potential reduction algorithm for linear programming
Mathematical Programming. Series A. Series B | 1991-01-01 | Paper |
Algorithms for the solution of quadratic knapsack problems
Linear Algebra and its Applications | 1991-01-01 | Paper |
A Centered Projective Algorithm for Linear Programming
Mathematics of Operations Research | 1990-01-01 | Paper |
A ``build-down scheme for linear programming
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4199975 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4197754 (Why is no real title available?)
| 1990-01-01 | Paper |
Interior-point algorithms for global optimization
Annals of Operations Research | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4197744 (Why is no real title available?)
| 1990-01-01 | Paper |
Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
Mathematics of Operations Research | 1990-01-01 | Paper |
An extension of Karmarkar's projective algorithm for convex quadratic programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4112388 (Why is no real title available?)
| 1989-01-01 | Paper |
Eliminating columns in the simplex method for linear programming
Journal of Optimization Theory and Applications | 1989-01-01 | Paper |
Karmarkar's algorithm and the ellipsoid method
Operations Research Letters | 1987-01-01 | Paper |
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
Mathematical Programming | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3815869 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 4026425 (Why is no real title available?)
| 1982-01-01 | Paper |
How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning
| N/A | Paper |
From an Interior Point to a Corner Point: Smart Crossover
| N/A | Paper |
An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization
| N/A | Paper |
A Universal Trust-Region Method for Convex and Nonconvex Optimization
| N/A | Paper |
cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language
| N/A | Paper |
A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming
| N/A | Paper |
A Low-Rank ADMM Splitting Approach for Semidefinite Programming
| N/A | Paper |
