| Publication | Date of Publication | Type |
|---|
An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
Acta Mathematicae Applicatae Sinica. English Series | 2025-01-13 | Paper |
New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems.
Kybernetika | 2024-12-04 | Paper |
An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
Journal of Applied Mathematics and Computing | 2024-08-08 | Paper |
A new full-Newton step feasible interior point method for convex quadratic programming
Optimization | 2024-04-25 | Paper |
Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
Boletim da Sociedade Paranaense de Matemática | 2024-02-08 | Paper |
Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
| 2023-06-02 | Paper |
An efficient logarithmic barrier method without line search for convex quadratic programming
Сибирский журнал вычислительной математики | 2023-03-29 | Paper |
scientific article; zbMATH DE number 7473683 (Why is no real title available?)
| 2022-02-14 | Paper |
Adaptive projection methods for linear fractional programming
RAIRO - Operations Research | 2021-07-27 | Paper |
Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
Journal of Siberian Federal University. Mathematics & Physics | 2021-03-18 | Paper |
A new efficient short-step projective interior point method for linear programming
Operations Research Letters | 2019-06-11 | Paper |
A penalty approach for a box constrained variational inequality problem
Applications of Mathematics | 2018-10-01 | Paper |
An efficient parameterized logarithmic kernel function for linear optimization
Optimization Letters | 2018-07-31 | Paper |
A numerical feasible interior point method for linear semidefinite programs
RAIRO - Operations Research | 2018-01-12 | Paper |
A numerical implementation of an interior point methods for linear programming based on a new kernel function
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
RAIRO - Operations Research | 2017-01-12 | Paper |
A feasible primal-dual interior point method for linear semidefinite programming
Journal of Computational and Applied Mathematics | 2016-10-21 | Paper |
A logarithmic barrier approach for linear programming
Journal of Computational and Applied Mathematics | 2016-10-21 | Paper |
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
Journal of Optimization Theory and Applications | 2016-08-31 | Paper |
Improving complexity of Karmarkar's approach for linear programming
Revue d'Analyse Numérique et de Théorie de l'Approximation | 2016-03-17 | Paper |
New effective projection method for variational inequalities problem
RAIRO - Operations Research | 2015-10-20 | Paper |
A weighted path-following method for linearly constrained convex programming
| 2014-02-05 | Paper |
Finding a strict feasible solution of a linear semidefinite program
Applied Mathematics and Computation | 2011-03-28 | Paper |
Applications of optimization methods for solving variational inequality problems
| 2009-03-26 | Paper |
An improving procedure of the interior projective method for linear programming
Applied Mathematics and Computation | 2008-06-11 | Paper |
scientific article; zbMATH DE number 5257259 (Why is no real title available?)
| 2008-04-03 | Paper |
A modified algorithm for the strict feasibility problem
RAIRO - Operations Research | 2002-08-18 | Paper |
Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation
| N/A | Paper |
