Interior-Point Methods for Linear Complementarity Problems
Goran Lesaja
Part of the Mathematics Commons
Works by Goran Lesaja in Mathematics
2018
Propensity Score Based Conditional Group Swapping for Disclosure Limitation of Strata-Defining Variables
Goran Lesaja
Full-Newton-Step Infeasible Interior-Point Method for LCP That Requires Only One Step Per Iteration
Goran Lesaja
Homogeneous Infeasible-Interior-Point Algorithm for the P*-Nonlinear Complementarity Problem
Goran Lesaja
A New Class of Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems
Goran Lesaja
An Asymptotical Homogeneous Interior-Point Algorithm for Linear Complementarity Problem
Goran Lesaja
A Class of Large- 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
Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems Based on a New Class of Kernel Functions
Goran Lesaja
Interior-Point Approach to Conic Quadratic Reformulation of Stratified Sampling Problem
Goran Lesaja
Introducing Interior-Point Methods Into the First Linear Programming or Operations Research Course
Goran Lesaja
Introducing Interior-Point Methods Into the Undergraduate Engineering Optimization Course
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
Infeasible Full Newton Step Interior-Point Algorithm for Linear Complementarity Problem
Goran Lesaja
Full NT-Step Interior Point Method for Cartesian ( ) P* - Linear Complementarity Problems over Symmetric Cones
Goran Lesaja
An Improved Feasible Full Nesterov-Todd Interior-Point Algorithm for Symmetric Optimization
Goran Lesaja
An Improved Infeasible Full Nesterov-Todd Interior-Point Algorithm for the Linear Complementarity Problem over Symmetric Cones
Goran Lesaja
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
Teaching Effectiveness Colloquium: Modeling for Insights, Excel Based Tools for Teaching Analytics, Engaging and Re-engaging Students with Active Learning
Goran Lesaja
Improved Full Newton-Step Infeasible Interior-Point Methods for Monotone Linear Complementarity Problems
Goran Lesaja
2013
Kernel Based Interior-Point Methods for P-Linear Complementary Problems over Symmetric Cones
Goran Lesaja
Improved Full NT-Step Feasible Interior-Point Methods for P*(κ)-Linear Complementarity Problems over Symmetric Cones
Department of Mathematical Sciences Faculty Presentations
Improved Full NT-Step Feasible Interior-Point Methods for P*(κ)-Linear Complementarity Problems over Symmetric Cones
Goran Lesaja
Full NT-Step Feasible Interior-Point Methods for P*(κ)-Linear Complementarity Problems over Symmetric Cones
Goran Lesaja
2012
Full Newton-Step Interior-Point Methods for Linear Complementarity Problems
Department of Mathematical Sciences Faculty Presentations
Infeasible Full Newton-Step Interior-Point Methods for P*(κ)-Linear Complementarity Problems
Goran Lesaja
Infeasible Full Newton-Step Interior-Point Methods for Monotone Linear Complementarity Problems
Goran Lesaja
2011
Interior-Point Methods for Cartesian P*(κ)-Linear Complementarity Problems over Symmetric Cones Based on the Eligible Kernel Functions
Department of Mathematical Sciences Faculty Presentations
Interior-Point Methods for Cartesian P*(κ)-Linear Complementarity Problems over Symmetric Cones Based on the Eligible Kernel Functions
Goran Lesaja
2010
Kernel-Based Interior-Point Methods for Cartesian P*(κ)-LCP over Symmetric Cones
Department of Mathematical Sciences Faculty Presentations
Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones
Goran Lesaja
2009
Unified Analysis of Kernel-Based Interior-Point Methods for P*(κ)-Linear Complementary Problems
Goran Lesaja
2008
Kernel Functions and Interior-Point Methods for Conic Linear Complementarity Problems
Department of Mathematical Sciences Faculty Presentations
Kernel Functions and Interior-Point Algorithms for Sufficient Linear Complementarity Problems
Department of Mathematical Sciences Faculty Presentations
Kernel Functions and Interior-Point Algorithms for Sufficient Linear Complementarity Problems
Goran Lesaja
Support of the Collaboration with the Research Group at the University of Delft, Delft, Netherlands (2008-2009)
Goran Lesaja
2007
Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems Based on a New Class of Kernel Functions
Department of Mathematical Sciences Faculty Presentations
A New Class of Polynomial Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems
Department of Mathematical Sciences Faculty Presentations
A New Class of Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems
Department of Mathematical Sciences Faculty Presentations
2006
A New Class of Primal-Dual Interior-Point Algorithms for Linear Optimization
Department of Mathematical Sciences Faculty Presentations
2005
A Class of Large- and Small - Update Primal-Dual Interior-Point Algorithms for Linear Optimization
Department of Mathematical Sciences Faculty Presentations
2003
Introducing Interior-Point Methods Into the Undergraduate Engineering Optimization Course
Department of Mathematical Sciences Faculty Presentations
Introducing Interior-Point Methods Into the First Operations Research Course
Department of Mathematical Sciences Faculty Presentations
2002
2001
Higher-Order Homogeneous Interior-Point Algorithm for Monotone LCP
Department of Mathematical Sciences Faculty Presentations
2000
Interior-Point Approach to Conic Quadratic Reformulation of Stratified Sampling Problem
Department of Mathematical Sciences Faculty Presentations
1999
An Asymptotical Homogeneous Interior-Point Algorithm for Linear Complementarity Problem
Department of Mathematical Sciences Faculty Presentations
1998
Introducing Interior-Point Methods Into the First Linear Programming or Operations Research Course
Department of Mathematical Sciences Faculty Presentations
1997
Homogeneous Infeasible-Interior-Point Algorithm for the P*-Nonlinear Complementarity Problem
Department of Mathematical Sciences Faculty Presentations