|
+
|
Quantum computing inspired iterative refinement for semidefinite optimization
|
2025
|
Mohammadhossein Mohammadisiahroudi
Brandon Augustino
Pouya Sampourmahani
Tamás Terlaky
|
|
+
PDF
Chat
|
A quantum dual logarithmic barrier method for linear optimization
|
2024
|
Zeguan Wu
Pouya Sampourmahani
Mohammadhossein Mohammadisiahroudi
Tamás Terlaky
|
|
+
PDF
Chat
|
A preconditioned inexact infeasible quantum interior point method for
linear optimization
|
2024
|
Zeguan Wu
Yang Xiu
Tamás Terlaky
|
|
+
PDF
Chat
|
Improvements to Quantum Interior Point Method for Linear Optimization
|
2024
|
Mohammadhossein Mohammadisiahroudi
Zeguan Wu
Brandon Augustino
Arielle Carr
Tamás Terlaky
|
|
+
PDF
Chat
|
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
|
2024
|
Mohammadhossein Mohammadisiahroudi
Ramin Fakhimi
Brandon Augustino
Tamás Terlaky
|
|
+
PDF
Chat
|
An Efficient Quantum Algorithm for Linear System Problem in Tensor
Format
|
2024
|
Zeguan Wu
Sidhant Misra
Tamás Terlaky
Xiu Yang
Marc Vuffray
|
|
+
|
Criss-Cross Pivoting Rules
|
2024
|
Tamás Terlaky
|
|
+
|
Least-Index Anticycling Rules
|
2024
|
Tamás Terlaky
|
|
+
PDF
Chat
|
Quantum Interior Point Methods for Semidefinite Optimization
|
2023
|
Brandon Augustino
Giacomo Nannicini
Tamás Terlaky
Luis F. Zuluaga
|
|
+
PDF
Chat
|
On relaxations of the max k-cut problem formulations
|
2023
|
Ramin Fakhimi
Hamidreza Validi
Illya V. Hicks
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization
|
2023
|
Mohammadhossein Mohammadisiahroudi
Ramin Fakhimi
Tamás Terlaky
|
|
+
PDF
Chat
|
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization
|
2023
|
Zeguan Wu
Mohammadhossein Mohammadisiahroudi
Brandon Augustino
Xiu Yang
Tamás Terlaky
|
|
+
|
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization
|
2023
|
Zeguan Wu
Mohammadhossein Mohammadisiahroudi
Brandon Augustino
Yang Xiu
Tamás Terlaky
|
|
+
|
On Semidefinite Representations of Second-order Conic Optimization Problems
|
2023
|
Pouya Sampourmahani
Mohammadhossein Mohammadisiahroudi
Tamás Terlaky
|
|
+
|
Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments
|
2023
|
Mohammadhossein Mohammadisiahroudi
Ramin Fakhimi
Brandon Augustino
Tamás Terlaky
|
|
+
|
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
|
2023
|
Brandon Augustino
Giacomo Nannicini
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
|
2023
|
Mohammadhossein Mohammadisiahroudi
Ramin Fakhimi
Zeguan Wu
Tamás Terlaky
|
|
+
|
On relaxations of the max $k$-cut problem formulations
|
2023
|
Ramin Fakhimi
Hamidreza Validi
Illya V. Hicks
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
Improvements to Quantum Interior Point Method for Linear Optimization
|
2023
|
Mohammadhossein Mohammadisiahroudi
Zeguan Wu
Brandon Augustino
Arriele Carr
Tamás Terlaky
|
|
+
|
A quantum central path algorithm for linear optimization
|
2023
|
Brandon Augustino
Jiaqi Leng
Giacomo Nannicini
Tamás Terlaky
Xiaodi Wu
|
|
+
|
Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization
|
2023
|
Mohammadhossein Mohammadisiahroudi
Brandon Augustino
Pouya Sampourmahani
Tamás Terlaky
|
|
+
|
Quantum Interior Point Methods for Conic Linear Optimization
|
2023
|
Brandon Augustino
Tamás Terlaky
|
|
+
PDF
Chat
|
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
|
2022
|
Muqing Zheng
Ang Li
Tamás Terlaky
Xiu Yang
|
|
+
PDF
Chat
|
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
|
2022
|
Jonathan D. Hauenstein
Ali Mohammad-Nezhad
Tingting Tang
Tamás Terlaky
|
|
+
PDF
Chat
|
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
|
2022
|
Rodolfo A. Quintero
David E. Bernal
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization
|
2022
|
Mohammadhossein Mohammadisiahroudi
Ramin Fakhimi
Tamás Terlaky
|
|
+
|
EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity
|
2022
|
Tibor Illés
Tamás Terlaky
|
|
+
PDF
Chat
|
Quantum Interior Point Methods for Semidefinite Optimization
|
2021
|
Brandon Augustino
Giacomo Nannicini
Tamás Terlaky
Luis F. Zuluaga
|
|
+
PDF
Chat
|
Quantum circuit design search
|
2021
|
Mohammad Pirhooshyaran
Tamás Terlaky
|
|
+
PDF
Chat
|
On the sensitivity of the optimal partition for parametric second-order conic optimization
|
2021
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
Quantum Interior Point Methods for Semidefinite Optimization
|
2021
|
Brandon Augustino
Giacomo Nannicini
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
Characterization of QUBO reformulations for the maximum $k$-colorable subgraph problem
|
2021
|
Rodolfo Quintero
David E. Bernal
Tamás Terlaky
Luis F. Zuluaga
|
|
+
|
Quantum Circuit Design Search
|
2020
|
Mohammad Pirhooshyaran
Tamás Terlaky
|
|
+
|
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
|
2020
|
Muqing Zheng
Ang Li
Tamás Terlaky
Xiu Yang
|
|
+
|
Quantum Circuit Design Search
|
2020
|
Mohammad Pirhooshyaran
Tamás Terlaky
|
|
+
PDF
Chat
|
Parametric analysis of semidefinite optimization
|
2019
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
On parametric second-order conic optimization
|
2019
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
On the sensitivity of the optimal partition for parametric second-order conic optimization.
|
2019
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
On the identification of the optimal partition for semidefinite optimization
|
2019
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
The Iteration-Complexity Upper Bound for the Mizuno-Todd-Ye Predictor-Corrector Algorithm is Tight
|
2019
|
Murat Mut
Tamás Terlaky
|
|
+
|
On the sensitivity of the optimal partition for parametric second-order conic optimization
|
2019
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
On computing the nonlinearity interval in parametric semidefinite optimization
|
2019
|
Jonathan D. Hauenstein
Ali Mohammad-Nezhad
Tingting Tang
Tamás Terlaky
|
|
+
PDF
Chat
|
A rounding procedure for semidefinite optimization
|
2018
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
|
2018
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
PDF
Chat
|
Invariance Preserving Discretization Methods of Dynamical Systems
|
2018
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
Parametric analysis of semidefinite optimization
|
2018
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
Parametric analysis of semidefinite optimization
|
2018
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
|
2017
|
Saeed Fallahi
Maziar Salahi
Tamás Terlaky
|
|
+
|
Chapter 1: Algorithms for Linear and Quadratic Optimization
|
2017
|
Tamás Terlaky
|
|
+
|
A novel unified approach to invariance conditions for a linear dynamical system
|
2016
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
|
2016
|
Pietro Belotti
Julio C. Góez
Imre Pólik
Ted K. Ralphs
Tamás Terlaky
|
|
+
|
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
|
2016
|
Ali Mohammad-Nezhad
Tamás Terlaky
|
|
+
|
Invariance Preserving Discretization Methods of Dynamical Systems
|
2016
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
PDF
Chat
|
Invariance Conditions for Nonlinear Dynamical Systems
|
2016
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
Invariance Conditions for Nonlinear Dynamical Systems
|
2016
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
Invariance Preserving Discretization Methods of Dynamical Systems
|
2016
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
Disjunctive conic cuts for mixed integer second order cone optimization
|
2015
|
Julio C. Góez
Tamás Terlaky
Pietro Belotti
Imre Pólik
Ted K. Ralphs
|
|
+
|
An Analogue of the Klee–Walkup Result for Sonnevend’s Curvature of the Central Path
|
2015
|
Murat Mut
Tamás Terlaky
|
|
+
|
Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron
|
2015
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
|
2015
|
Pietro Belotti
Julio C. Góez
Imre Pólik
Ted K. Ralphs
Tamás Terlaky
|
|
+
|
A Novel Unified Approach to Invariance in Control
|
2014
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
|
2014
|
Tamás Terlaky
Zhouhong Wang
|
|
+
|
A Novel Unified Approach to Invariance for a Dynamical System
|
2014
|
Zoltán Horváth
Yunfei Song
Tamás Terlaky
|
|
+
|
Mixed-Integer Conic Linear Programming: Challenges and Perspectives
|
2013
|
Tamás Terlaky
|
|
+
|
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
|
2013
|
Tamás Terlaky
|
|
+
|
On families of quadratic surfaces having fixed intersections with two hyperplanes
|
2013
|
Pietro Belotti
Julio C. Góez
Imre Pólik
Ted K. Ralphs
Tamás Terlaky
|
|
+
PDF
Chat
|
Special issue in honour of Professor Kees Roos’ 70th Birthday
|
2013
|
Tamás Terlaky
Etienne de Klerk
Goran Lesaja
Dick den Hertog
|
|
+
|
Interior-Point Methods for Conic-Linear Optimization
|
2013
|
Tamás Terlaky
Paul T. Boggs
|
|
+
|
Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications
|
2012
|
Oleksandr Romanko
Alireza Ghaffari-Hadigheh
Tamás Terlaky
|
|
+
|
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
|
2011
|
Mohammad R. Oskoorouchi
Hamid R. Ghaffari
Tamás Terlaky
Dionne M. Aleman
|
|
+
|
Convex approximations in stochastic programming by semidefinite programming
|
2011
|
István Deák
Imre Pólik
András Prékopa
Tamás Terlaky
|
|
+
|
Self-Regular Interior-Point Methods for Semidefinite Optimization
|
2011
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
Introduction to Polynomial Time Algorithms for<scp>LP</scp>
|
2011
|
Tamás Terlaky
|
|
+
|
Nonlinear Optimization: Lectures given at the C.I.M.E. Summer School held in Cetraro, Italy, July 1-7, 2007
|
2010
|
Immanuel M. Bomze
V. F. Demʹi︠a︡nov
R. Fletcher
Tamás Terlaky
Gianni Di Pillo
Fabio Schoen
|
|
+
PDF
Chat
|
Interior Point Methods for Nonlinear Optimization
|
2010
|
Imre Pólik
Tamás Terlaky
|
|
+
|
Polynomial Interior Point Algorithms for General Linear Complementarity Problems
|
2010
|
Tibor Illés
Marianna Nagy
Tamás Terlaky
|
|
+
|
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
|
2010
|
Yang Li
Tamás Terlaky
|
|
+
PDF
Chat
|
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
|
2009
|
Miguel Á. Goberna
Tamás Terlaky
M. I. Todorov
|
|
+
|
Bi-parametric convex quadratic optimization
|
2009
|
Alireza Ghaffari-Hadigheh
Oleksandr Romanko
Tamás Terlaky
|
|
+
|
A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION
|
2009
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes
|
2009
|
Antoine Deza
Tamás Terlaky
Yuriy Zinchenko
|
|
+
|
On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
|
2008
|
Mohammad H. Koulaei
Tamás Terlaky
|
|
+
|
A polynomial path-following interior point algorithm for general linear complementarity problems
|
2008
|
Tibor Illés
Marianna E.-Nagy
Tamás Terlaky
|
|
+
|
New stopping criteria for detecting infeasibility in conic optimization
|
2008
|
Imre Pólik
Tamás Terlaky
|
|
+
|
Diameter and Curvature: Intriguing Analogies
|
2008
|
Antoine Deza
Tamás Terlaky
Feng Xie
Yuriy Zinchenko
|
|
+
PDF
Chat
|
A Continuous d-Step Conjecture for Polytopes
|
2008
|
Antoine Deza
Tamás Terlaky
Yuriy Zinchenko
|
|
+
|
Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework
|
2008
|
Yuriy Zinchenko
Tim Craig
H. Keller
Tamás Terlaky
Michael Sharpe
|
|
+
|
Optimizing Teardrop, an MRI sampling trajectory
|
2008
|
Christopher Kumar Anand
Tingting Ren
Tamás Terlaky
|
|
+
|
Self-adaptive support vector machines: modelling and experiments
|
2008
|
Peng Du
Jiming Peng
Tamás Terlaky
|
|
+
|
Efficient preprocessing for VLSI optimization problems
|
2008
|
Warren Hare
M. J. J. Liu
Tamás Terlaky
|
|
+
|
The colourful feasibility problem
|
2008
|
Antoine Deza
Sui Huang
Tamon Stephen
Tamás Terlaky
|
|
+
|
A redundant Klee–Minty construction with all the redundant constraints touching the feasible region
|
2008
|
Eissa Nematollahi
Tamás Terlaky
|
|
+
|
Mehrotra-type predictor-corrector algorithm revisited
|
2008
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization
|
2008
|
Alireza Ghaffari-Hadigheh
Habib Ghaffari Hadigheh
Tamás Terlaky
|
|
+
|
ON BI-PARAMETRIC PROGRAMMING IN QUADRATIC OPTIMIZATION
|
2008
|
Alireza Ghaffari-Hadigheh
Oleksandr Romanko
Tamás Terlaky
|
|
+
|
Least-index Anticycling Rules
|
2008
|
Tamás Terlaky
|
|
+
|
Principal Pivoting Methods for Linear Complementarity Problems
|
2008
|
Tamás Terlaky
|
|
+
|
Criss-Cross Pivoting Rules
|
2008
|
Tamás Terlaky
|
|
+
|
On Mehrotra-Type Predictor-Corrector Algorithms
|
2007
|
Maziar Salahi
Jingjing Peng
Tamás Terlaky
|
|
+
|
An EP theorem for DLCP and interior point methods
|
2007
|
Tibor Illés
Marianna Nagy
Tamás Terlaky
|
|
+
|
Polytopes and arrangements: Diameter and curvature
|
2007
|
Antoine Deza
Tamás Terlaky
Yuriy Zinchenko
|
|
+
|
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors
|
2007
|
Alireza Ghaffari-Hadigheh
Oleksandr Romanko
Tamás Terlaky
|
|
+
|
Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization
|
2007
|
Alireza Ghaffari-Hadigheh
Kamal Mirnia
Tamás Terlaky
|
|
+
|
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
|
2007
|
Maziar Salahi
M. Reza Peyghami
Tamás Terlaky
|
|
+
|
Seventh IMACS International Symposium on Iterative Methods in Scientific Computing May 5–8, 2005 The University of Toronto, Toronto, Ontario, Canada
|
2007
|
Christina C. Christara
Peter Forsyth
Tamás Terlaky
Justin W. L. Wan
|
|
+
|
Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization
|
2007
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
Polynomial interior point algorithms for general LCPs
|
2007
|
Tibor Illés
Marianna E.-Nagy
Tamás Terlaky
|
|
+
|
A Survey of the S-Lemma
|
2007
|
Imre Pólik
Tamás Terlaky
|
|
+
|
Postponing the choice of the barrier parameter in Mehrotra-type predictor–corrector algorithms
|
2006
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds
|
2006
|
Antoine Deza
Eissa Nematollahi
Tamás Terlaky
|
|
+
PDF
Chat
|
The central path visits all the vertices of the Klee–Minty cube
|
2006
|
Antoine Deza
Eissa Nematollahi
M. Reza Peyghami
Tamás Terlaky
|
|
+
|
Sensitivity Analysis In Linear And Convex Quadratic Optimization: Invariant Active Constraint Set And Invariant Set Intervals<sup>*</sup>
|
2006
|
Alireza Ghaffari-Hadigheh
Kamal Mirnia
Tamás Terlaky
|
|
+
PDF
Chat
|
Colourful Simplicial Depth
|
2006
|
Antoine Deza
Sui Huang
Tamon Stephen
Tamás Terlaky
|
|
+
PDF
Chat
|
Generalized support set invariancy sensitivity analysis in linear optimization
|
2006
|
Alireza Ghaffari-Hadigheh
Tamás Terlaky
|
|
+
|
The Complexity of Self-Regular Proximity Based Infeasible IPMs
|
2005
|
Maziar Salahi
Tamás Terlaky
Guoqing Zhang
|
|
+
|
Interior Point and Semidefinite Approaches in Combinatorial Optimization
|
2005
|
Kartik Krishnan
Tamás Terlaky
|
|
+
|
Sensitivity analysis in linear optimization: Invariant support set intervals
|
2005
|
Alireza Ghaffari-Hadigheh
Tamás Terlaky
|
|
+
|
Sensitivity analysis in convex quadratic optimization: invariant support set interval
|
2005
|
Alireza Ghaffari-Hadigheh
Tamás Terlaky
|
|
+
|
An adaptive self-regular proximity-based large-update IPM for LO
|
2005
|
Maziar Salahi
Tamás Terlaky
|
|
+
|
Interior Point Methods for Linear Optimization
|
2005
|
C. Roos
Tamás Terlaky
J.‐P. Vial
|
|
+
|
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
|
2005
|
Jiming Peng
Tamás Terlaky
Yun-Bin Zhao
|
|
+
|
Colourful Simplicial Depth
|
2005
|
Antoine Deza
Sui Huang
Tamon Stephen
Tamás Terlaky
|
|
+
|
The Colourful Feasibility Problem
|
2005
|
Antoine Deza
Sui Huang
Tamon Stephen
Tamás Terlaky
|
|
+
|
On self-regular IPMs
|
2004
|
Maziar Salahi
Renata Sotirov
Tamás Terlaky
|
|
+
|
Conic Formulation for l p -Norm Optimization
|
2004
|
François Glineur
Tamás Terlaky
|
|
+
|
Nonlinear Optimization (CO 367)
|
2004
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Special Issue: Smooth and Nonsmooth Optimization
|
2004
|
Jan Brinkhuis
Tibor Illés
Hans Frenk
Georg Still
Gerhard‐Wilhelm Weber
Tamás Terlaky
|
|
+
|
Self-regularity: A new paradigm for primal-dual interior-point algorithms
|
2003
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
On implementing a primal-dual interior-point method for conic quadratic optimization
|
2003
|
Erling D. Andersen
C. Roos
Tamás Terlaky
|
|
+
|
None
|
2003
|
Tamás Terlaky
|
|
+
|
A new class of polynomial primal–dual methods for linear and semidefinite optimization
|
2002
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Pivot versus interior point methods: Pros and cons
|
2002
|
Tibor Illés
Tamás Terlaky
|
|
+
|
Self-regular functions and new search directions for linear and semidefinite optimization
|
2002
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Notes on Duality in Second Order and p -Order Cone Optimization
|
2002
|
Erling D. Andersen
C. Roos
Tamás Terlaky
|
|
+
|
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
|
2002
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
A dynamic large-update primal‐dual interior-point method for linear optimization
|
2002
|
Jiming Peng
Tamás Terlaky
|
|
+
|
New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction
|
2001
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
An easy way to teach interior-point methods
|
2001
|
Tamás Terlaky
|
|
+
|
A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem
|
2001
|
Erling D. Andersen
John E. Mitchell
C. Roos
Tamás Terlaky
|
|
+
|
A NEW AND EFFICIENT LARGE-UPDATE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION
|
2001
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
PDF
Chat
|
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization
|
2001
|
Etienne de Klerk
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
A scaled Gauss-Newton primal-dual search direction for semidefinite optimization
|
2001
|
Etienne de Klerk
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Principal Pivoting Methods for Linear Complementarity Problems
|
2001
|
Tamás Terlaky
|
|
+
|
A scaled Gauss-Newton primal-dual search direction for semidefinite optimization
|
2001
|
Etienne de Klerk
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Least-Index Anticycling Rules
|
2001
|
Tamás Terlaky
|
|
+
|
Criss-Cross Pivoting Rules
|
2001
|
Tamás Terlaky
|
|
+
|
Pivot versus interior point methods
|
2000
|
Tibor Illés
Tamás Terlaky
|
|
+
|
Self-Dual Embeddings
|
2000
|
Etienne de Klerk
Tamás Terlaky
C. Roos
|
|
+
|
None
|
2000
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
None
|
2000
|
Immanuel M. Bomze
Mirjam Dür
Etienne de Klerk
C. Roos
A.J. Quist
Tamás Terlaky
|
|
+
|
On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
|
2000
|
K. Fukuda
Tamás Terlaky
|
|
+
|
Central Region Method
|
2000
|
Hans Frenk
C. Roos
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
|
2000
|
Tibor Illés
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Theory and algorithms for semidefinite programming : Introduction
|
2000
|
J.F. Sturm
J. B. G. Frenk
C. Roos
Tamás Terlaky
S. Zhang
|
|
+
|
New Complexity Analysis of Primal-Dual Newton Methods for P *(κ) Linear Complementarity Problems
|
2000
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Introduction
|
2000
|
Hans Frenk
C. Roos
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
Superlinear Convergence
|
2000
|
Hans Frenk
C. Roos
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
High Performance Optimization
|
2000
|
Hans Frenk
C. Roos
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
A Logarithmic Barrier Approach to Fischer Function
|
2000
|
Jiming Peng
C. Roos
Tamás Terlaky
|
|
+
|
Self-Dual Embedding Technique
|
2000
|
Hans Frenk
C. Roos
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
On maximization of quadratic form over intersection of ellipsoids with common center
|
1999
|
Arkadi Nemirovski
C. Roos
Tamás Terlaky
|
|
+
|
A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm
|
1999
|
Tamás Terlaky
Takashi Tsuchiya
|
|
+
|
Basis- and partition identification for quadratic programming and linear complementarity problems
|
1999
|
Arjan Berkelaar
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
Note on a paper of Broyden
|
1999
|
C. Roos
Tamás Terlaky
|
|
+
|
The finite criss-cross method for hyperbolic programming
|
1999
|
Tibor Illés
Ákos Szirmai
Tamás Terlaky
|
|
+
|
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
|
1999
|
Zhi‐Quan Luo
C. Roos
Tamás Terlaky
|
|
+
|
Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
|
1999
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Infeasible-start semidefinite programming algorithms via self-dual embeddings
|
1998
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
None
|
1998
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
None
|
1998
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Computing Maximum Likelihood Estimators of Convex Density Functions
|
1998
|
Tamás Terlaky
Jean-Philippe Vial
|
|
+
|
Copositive realxation for genera quadratic programming
|
1998
|
A.J. Quist
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance
|
1998
|
Harvey J. Greenberg
Allen Holder
C. Roos
Tamás Terlaky
|
|
+
|
On Primal—Dual Path—Following Algorithms for Semidefinite Programming
|
1998
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
A strongly polynomial rounding procedure yielding a maximally complementary solution for P(*)(k) linear complementarity problems
|
1998
|
Tibor Illés
Jigen Peng
Clément Roos
Tamás Terlaky
|
|
+
PDF
Chat
|
Criss-cross methods: A fresh view on pivot algorithms
|
1997
|
Komei Fukuda
Tamás Terlaky
|
|
+
|
Potential reduction algorithms for structured combinatorial optimization problems
|
1997
|
Joost P. Warners
Tamás Terlaky
C. Roos
Benjamin Jansen
|
|
+
|
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
|
1997
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Akiko Yoshise
|
|
+
|
Sensitivity analysis in linear programming: just be careful!
|
1997
|
Benjamin Jansen
J.J. de Jong
C. Roos
Tamás Terlaky
|
|
+
|
Logarithmic barrier decomposition methods for semi-infinite programming
|
1997
|
John A. Kaliski
David J. Haglin
C. Roos
Tamás Terlaky
|
|
+
|
Logarithmic Barrier Decomposition Methods for Semi‐infinite Programming
|
1997
|
John A. Kaliski
David J. Haglin
C. Roos
Tamás Terlaky
|
|
+
|
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
|
1997
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
|
1997
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
PDF
Chat
|
The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming
|
1997
|
Arjan Berkelaar
C. Roos
Tamás Terlaky
|
|
+
|
Inverse barriers and CES-functions in linear programming
|
1997
|
Hans van Maaren
Tamás Terlaky
|
|
+
|
Method of approximate centers for semi-definite programming
|
1997
|
Bing He
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
|
1997
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Y. Ye
|
|
+
|
Polynomial Affine-Scaling Algorithms for P * (к) Linear Complementary Problems
|
1997
|
Tibor Illés
C. Roos
Tamás Terlaky
|
|
+
|
CHAPTER 6 THE OPTIMAL SET AND OPTIMAL PARTITION ApPROACH TO LINEAR AND QUADRATIC PROGRAMMING
|
1997
|
Arjan Berkelaar
C. Roos
Tamás Terlaky
|
|
+
|
Initialization in semidefinite programming via a self-dual, skew-symmetric embedding
|
1997
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Initialization in semidefinite programming via a self-dual, skew-symmetric embedding
|
1997
|
Etienne de Klerk
C. Roos
Tamás Terlaky
|
|
+
|
Primal-dual target-following algorithms for linear programming
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Jean-Philippe Vial
|
|
+
|
A computational view of interior point methods
|
1996
|
Jacek Gondzio
Tamás Terlaky
|
|
+
|
An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
|
1996
|
Luís Portugal
Fernando Loureiro Bastos
Joaquím J. Júdice
José M. P. Paixão
Tamás Terlaky
|
|
+
|
A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
Long-step primal-dual target-following algorithms for linear programming
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Jean-Philippe Vial
|
|
+
|
Basis- and tripartition identification for quadratic programming and lineair complementary problems; From an interior solution to an optimal basis and viceversa
|
1996
|
Arjan Berkelaar
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming
|
1996
|
Arjan Berkelaar
C. Roos
Tamás Terlaky
|
|
+
|
Basis- and tripartition identification for quadratic programming and lineair complementary problems; From an interior solution to an optimal basis and viceversa
|
1996
|
Arjan Berkelaar
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
Introduction to the Theory of Interior Point Methods
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
Target-Following Methods for Linear Programming
|
1996
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
|
1995
|
Osman Güler
C. Roos
Tamás Terlaky
Jean-Philippe Vial
|
|
+
|
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
|
1995
|
Dick den Hertog
Florian Jarre
C. Roos
Tamás Terlaky
|
|
+
|
A logarithmic barrier cutting plane method for convex programming
|
1995
|
Dick den Hertog
John A. Kaliski
C. Roos
Tamás Terlaky
|
|
+
|
Primal-dual affine-scaling algorithms for nonlinear monotone complementarity problems
|
1994
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Akiko Yoshise
|
|
+
|
Pseudoconvex optimization for a special problem of paint industry
|
1994
|
Tibor Illés
János Mayer
Tamás Terlaky
|
|
+
|
Primal-dual algorithms for linear programming based on the logarithmic barrier method
|
1994
|
Benjamin Jansen
C. Roos
Tamás Terlaky
J.‐P. Vial
|
|
+
|
A Monotonic Build-Up Simplex Algorithm for Linear Programming
|
1994
|
Kurt M. Anstreicher
Tamás Terlaky
|
|
+
PDF
Chat
|
Inverse barrier methods for linear programming
|
1994
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
Adding and Deleting Constraints in the Logarithmic Barrier Method for LP
|
1994
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup>
|
1994
|
Benjamin Jansen
C. Roos
Tamás Terlaky
|
|
+
|
A Long-step barrier method for convex quadratic programming
|
1993
|
Kurt M. Anstreicher
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
The linear complimentarity problem, sufficient matrices, and the criss-cross method
|
1993
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
Pivot rules for linear programming: A survey on recent theoretical developments
|
1993
|
Tamás Terlaky
Shuzhong Zhang
|
|
+
|
Degeneracy in interior point methods for linear programming: a survey
|
1993
|
Osman Güler
D. den Hertog
C. Roos
Tamás Terlaky
Takashi Tsuchiya
|
|
+
|
Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects
|
1993
|
Benjamin Jansen
C. Roos
Tamás Terlaky
Jean-Philippe Vial
|
|
+
|
A build-up variant of the logarithmic barrier method for LP
|
1992
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
A GEOMETRIC PROGRAMMING APPROACH TO THE CHANNEL CAPACITY PROBLEM
|
1992
|
Emil Klafszky
János Mayer
Tamás Terlaky
|
|
+
|
On the classical logarithmic barrier function method for a class of smooth convex programming problems
|
1992
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
|
1992
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
A Survey on Pivot Rules for Linear Programming
|
1992
|
Tamás Terlaky
Shuaixiang Zhang
|
|
+
|
Some generalizations of the criss-cross method for quadratic programming
|
1992
|
Emil Klafszky
Tamás Terlaky
|
|
+
PDF
Chat
|
LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
|
1992
|
Komei Fukuda
Tamás Terlaky
|
|
+
|
On the monotonicity of the dual objective along barrier paths
|
1992
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
A potential-reduction variant of Renegar's short-step path-following method for linear programming
|
1991
|
Dick den Hertog
C. Roos
Tamás Terlaky
|
|
+
|
The role of pivoting in proving some fundamental theorems of linear algebra
|
1991
|
Emil Klafszky
Tamás Terlaky
|
|
+
|
A Polynomial Method of Weighted Centers for Convex Quadratic Programming
|
1991
|
Dick den Hertog
Brian Roos
Tamás Terlaky
|
|
+
|
Linearly constrained estimation by mathematical programming
|
1989
|
Emil Klafszky
János Mayer
Tamás Terlaky
|
|
+
|
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
|
1989
|
Emil Klafszky
Tamás Terlaky
|
|
+
|
A new algorithm for quadratic programming
|
1987
|
Tamás Terlaky
|
|
+
|
A finite crisscross method for oriented matroids
|
1987
|
Tamás Terlaky
|
|
+
|
On ℓp programming
|
1985
|
Tamás Terlaky
|
|
+
|
A convergent criss-cross method
|
1985
|
Tamás Terlaky
|