Interior-Point Methods for Linear Complementarity Problems
Goran Lesaja
Part of the Education Commons
Works by Goran Lesaja in Education
2018
Propensity Score Based Conditional Group Swapping for Disclosure Limitation of Strata-Defining Variables
Goran Lesaja
2016
Research and Evaluation of the Effectiveness of E-Learning in the Case of Linear Programming
Goran Lesaja
Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization
Goran Lesaja
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
Goran Lesaja
2015
Interior-Point Methods for Linear Complementarity Problems
Department of Mathematical Sciences Faculty Publications
2014
Kernel-Based Interior-Point Methods for Cartesian P*(κ)-Linear Complementarity Problems over Symmetric Cones
Goran Lesaja
Introducing Interior-Point Methods for Introductory Operations Research Courses and/or Linear Programming Courses
Goran Lesaja
Interior-Point Methods for Cartesian P *(κ) -Linear Complementarity Problems over Symmetric Cones Based on the Eligible Kernel Functions
Goran Lesaja
Common-Wavelengths Design Scheme for Efficient Utilization of Wavelength Resources in WDM Networks
Goran Lesaja
A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization
Goran Lesaja
A New Class of Polynomial Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems
Goran Lesaja
Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones
Goran Lesaja