Khamisov Oleg Valerievich

Publications in Math-Net.Ru

1. Optimization of the Optimal Value Function in Problems of Convex Parametric Programming
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023),  247–260
2. Dual estimates in the model of expansion of electric power systems
   
   Avtomat. i Telemekh., 2022, no. 5,  43–60
3. A mathematical model of managing a regulated monopoly district heating market
   
   Probl. Upr., 2022, no. 2,  12–23
4. Justification of effectiveness of international power interconnections with separation of effects between participants
   
   Avtomat. i Telemekh., 2018, no. 10,  26–38
5. Search for Cournot equilibrium on the heat energy market in the conditions of heat sources competitive behaviour
   
   Probl. Upr., 2017, no. 1,  10–18
6. Approximation of the measure of a convex compact set
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  272–279
7. Finding Roots of Nonlinear Equations Using the Method of Concave Support Functions
   
   Mat. Zametki, 98:3 (2015),  427–435
8. Deep cuts in concave and linear 0-1 programming
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  294–304
9. Nonconvex optimization with nonlinear support functions
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  295–306
10. Development optimization methods in investigations of V. P. Bulatov
    
    Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011),  6–15
11. Cutting methods in $E^{n+1}$ for global optimization of a class of functions
    
    Zh. Vychisl. Mat. Mat. Fiz., 47:11 (2007),  1830–1842
12. Numerical solution of special problems of nonconvex quadratic programming
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005),  81–91
13. Control of power grid development: numerical solutions
    
    Avtomat. i Telemekh., 2004, no. 3,  125–136
14. Algebraic solution of the problems of nonconvex quadratic programming
    
    Avtomat. i Telemekh., 2004, no. 2,  69–78
15. Automatic global optimization
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 11:2 (2004),  45–68
16. Global optimization of functions with concave support minorant
    
    Zh. Vychisl. Mat. Mat. Fiz., 44:9 (2004),  1552–1563
17. The branch-and-bound method for the problem of minimizing a nonconvex quadratic function under convex quadratic constraints
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  74–88
18. A modified simplex immersions method with simultaneous introduction of several intersecting planes
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  16–24