The following pages link to Goran Lešaja (Q320393):
Displaying 25 items.
- Generalized diamond-\(\alpha\) dynamic Opial inequalities (Q320395) (← links)
- (Q493058) (redirect page) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP (Q1365467) (← links)
- Erratum to: ``Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization'' (Q1673906) (← links)
- (Q2198531) (redirect page) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- A new method for finding cycles by semilinear control (Q2231196) (← links)
- (Q2903230) (← links)
- (Q2966417) (← links)
- Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems (Q2966478) (← links)
- Research and evaluation of the effectiveness of e-learning in the case of linear programming (Q2966487) (← links)
- Interior-point algorithms for a class of convex optimization problems (Q3070716) (← links)
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems (Q3083319) (← links)
- Introducing Interior-Point Methods for Introductory Operations Research Courses and/or Linear Programming Courses (Q3192856) (← links)
- Equivaence between different formulations of the linear complementarity promblem (Q4345240) (← links)
- (Q4521813) (← links)
- Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems (Q4928114) (← links)
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
- Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
- Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP (Q5299915) (← links)
- (Q5453751) (← links)
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem (Q6596330) (← links)
