سامانه پژوهشی دانشگاه شهید مدنی آذربایجان | بهروز خيرفام

نام و نام خانوادگی	بهروز خیرفام
شغل	عضو هیئت علمی دانشگاه شهید مدنی آذربایجان / دانشکده علوم پایه / گروه ریاضی کاربردی و محض
تحصیلات	دکترای تخصصی / ریاضی کاربردی(بهینه سازی)
مرتبه علمی	استاد
صفحه شخصی	—
پست الکترونیک	b [dot] kheirfam [at] azaruniv [dot] ac [dot] ir

	عنوان	مجله
1	A new search direction for full-Newton step infeasible interior-point method in linear optimization	Croatian Operational Research Review 14 (2023) 193-202
2	A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term	Journal of Applied Mathematics and Computing 69 (2023) 2935–2953
3	Corrector-Predictor Interior-Point Method With New Search Direction for Semidefinite Optimization	JOURNAL OF SCIENTIFIC COMPUTING 95 (2023) 10-10
4	A wide neighborhood primal-dual predictor-corrector interior-point algorithm with new corrector directions for linear optimization	تحقیق در عملیات ـ انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research 12 (1401) 130-145
5	یک روش نقطه درونی نشدنی با گام کامل نیوتن اصلاح شده برای مسالۀ مکملی خطی یکنوا	پژوهش های ریاضی 7 (1400) 749-763
6	A new corrector–predictor interior-point method for symmetric cone optimization	Periodica Mathematica Hungarica 0 (2022) 1-16
7	A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization	JOURNAL OF SCIENTIFIC COMPUTING 88 (2021) 1-23
8	A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization	Journal of Applied Mathematics and Computing 0 (2021) 1-21
9	A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specic kernel function	Communications in Combinatorics and Optimization 0 (2021) 1-16
10	A Second-Order Corrector Infeasible Interior-Point Method for Semidefinite Optimization Based on aWide Neighborhood	JOURNAL OF SCIENTIFIC COMPUTING 86 (2021) article 13
11	A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood	FUNDAMENTA INFORMATICAE 177 (2020) 141-156
12	An interior-point method for symmetric optimization based on a new wide neighborhood	Pacific Journal of Optimization 16 (2020) 625-640
13	An arc-search infeasible interior-pointmethod for semidefinite optimization with the negative infinity neighborhood	Numerical Algorithms 0 (2020) 1-21
14	A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization	Optimization Letters 17 (2020) 1747–1763
15	A wide neighborhood interior-point algorithm based on the trigonometric kernel function	Journal of Applied Mathematics and Computing 64 (2020) 119-135
16	A corrector–predictor interior-point method with new search direction for linear optimization	Central European Journal of Operations Research 28 (2020) 1123–1140
17	A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization	Optimization Letters 0 (2020) 1
18	An O(nL) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighborhood	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 0 (2020) 1-23
19	A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization	FUNDAMENTA INFORMATICAE 172 (2020) 343-359
20	A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps	Numerical Algorithms DOI (2019) 0
21	A new full-NT step interior-point method for circular cone optimization	Croatian Operational Research Review 10 (2019) 275-287
22	A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization	Optimization 68 (2019) 2247-2267
23	A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function	Periodica Mathematica Hungarica 79 (2019) 94-105
24	A New Search Direction for Full Newton Step Interior Point Method in P_*(k)- HLCP	Numerical Functional Analysis and Optimization 40 (2019) 1169–1181
25	ک روش نقطه درونی نشدنی با گام کامل NT با پیچیدگی (O(n برای حاصل ضرب دکارتی P_*(k) –HLCP روی مخروط های متقارن با استفاده از تحدب نمایی	پژوهش های نوین در ریاضی 4 (1397) 123-140
26	A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation	FUNDAMENTA INFORMATICAE 163 (2018) 325-337
27	An extension for identifying search directions for interior-point methods in linear optimization	Asian-European Journal of Mathematics 13 (2018) 2050014(12 Pages)
28	ON THE EXTENSION OF AN ARC-SEARCH INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION	Numerical Algebra,Control And Optimization 8 (2018) 261-275
29	Polynomial convergence of two higher order interior-point methods for P∗(κ)-LCP in a wide neighborhood of the central path	Periodica Mathematica Hungarica 76 (2018) 243-264
30	An infeasible interior point method for the monotone SDLCP based on a transformation of the central path	Journal of Applied Mathematics and Computing 57 (2018) 685-702
31	A Modified and Simplified Full Nesterov–Todd Step O(N) Infeasible Interior-Point Method for Second-Order Cone Optimization	Journal of the Operations Research Society of China 6 (2018) 301-315
32	Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function	Optimization Letters DOI (2018) 1-19
33	An infeasible interior-point method for the P(k)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step	Communications in Combinatorics and Optimization 3 (2018) 51-70
34	NEW COMPLEXITY ANALYSIS OF FULL NESTEROV-TODD STEP INFEASIBLE INTERIOR POINT METHOD FOR SECOND-ORDER CONE OPTIMIZATION	Yugoslav Journal of Operations Research 28 (2018) 21-38
35	A New Second-Order Corrector Interior-Point Algorithm for P(k)-LCP	Filomat 31 (2018) 6379–6391
36	New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization	Asian-European Journal of Mathematics 10 (2017) 1750070
37	An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the neighbourhood of the central path	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 94 (2017) 2271–2282
38	A Corrector-Predictor Arc-search Interior Point Algorithm for 𝑷∗(𝜿)-LCP Acting in a Wide Neighborhood of the Central Path	تحقیق در عملیات ـ انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research 6 (1396) 1-18
39	A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions	FUNDAMENTA INFORMATICAE 153 (2017) 327-346
40	A full-Newton step infeasible interior-point method based on a new search direction	Pacific Journal of Optimization 13 (2017) 463-473
41	A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds	Afrika Matematika 28 (2017) 389-406
42	AN INFEASIBLE FULL NT-STEP INTERIOR POINT METHOD FOR CIRCULAR OPTIMIZATION	Numerical Algebra,Control And Optimization 7 (2017) 171 - 184
43	A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in aWide Neighborhood	FUNDAMENTA INFORMATICAE 152 (2017) 33-50
44	An infeasible full-NT step interior point algorithm for CQSCO	Numerical Algorithms 74 (2017) 93-109
45	A full-Newton step feasible interior-point algorithm for P∗(k)-LCP based on a new search direction	Croatian Operational Research Review 7 (2016) 277-290
46	A full Nesterov-Todd step interior-point method for circular cone optimization	Communications in Combinatorics and Optimization 1 (2016) 83-102
47	A corrector–predictor path-following method for second-order cone optimization	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 93 (2016) 2064-2078
48	AN IMPROVED INFEASIBLE INTERIOR-POINT METHOD FOR SYMMETRIC CONE LINEAR COMPLEMENTARITY PROBLEM	Bulletin of the Iranian Mathematical Society 42 (2016) 55-66
49	An Infeasible Interior-point Method for Monotone LCP Based on a Kernel Function With Full-Newton Step	Southeast Asian Bulletin of Mathematics 40 (2016) 707-722
50	An improved and modified infeasible interior-point method for symmetric optimization	Asian-European Journal of Mathematics 9 (2016) 1650059
51	An Arc-search Interior Point Method in the N-Neighborhood for Symmetric Optimization	FUNDAMENTA INFORMATICAE 146 (2016) 255-269
52	A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function	Optimization 65 (2016) 841-857
53	A predictor-corrector algorithm for $P_{*}(\kappa)$-linear complementarity problems based on a specific self-regular proximity function	Acta Mathematica Vietnamica 41 (2016) 103–120
54	An improved full-Newton step $O(n)$ infeasible interior-point method for horizontal linear complementarity problem	Numerical Algorithms 71 (2016) 491-503
55	A full step infeasible interior-point method for Cartesian $P_{*}(\kappa)$-SCLCP	Optimization Letters 10 (2016) 591-603
56	Simplified analysis of a full Nesterov–Todd step infeasible interior-point method for symmetric optimization	Asian-European Journal of Mathematics 8 (2015) 1550071 (14 pages)
57	An infeasible interior-point method for the Cartesian $P_*(\kappa)$ second-order cone linear complementarity problem with one centering step	Studia Universitatis Babes-Bolyai Series Informatica LX (2015) 21-36
58	A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization	Numerical Functional Analysis and Optimization 36 (2015) 1322-1338
59	A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term	Yugoslav Journal of Operations Research 25 (2015) 233-250
60	An infeasible interior-point algorithm based on modified Nesrerov and Todd directions for symmetric linear complementarity problem	Optimization 64 (2015) 1577-1591
61	An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization	Journal of Mathematical Modelling and Algorithms 14 (2015) 55-66
62	A corrector-predictor path-following method for convex quadratic symmetric cone optimization	JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 164 (2015) 246-260
63	A New complexity analysis for full-Newton step infeasible interior-point algorithm for Horizontal linear complementarity problems	JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014) 853-869
64	A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function	Journal of Mathematical Modelling and Algorithms in Operations Research 13 (2014) 471-491
65	A corrector–predictor path-following algorithm for semidefinite optimization	Asian-Eur.J. Math Issn: 1793-5571 (2014) 246-260
66	An interior-point method for catesian $p-{*}(\kappa)$-linear complementarity problem over symmetric cones	Orion (2014) 41-58
67	A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem	Bulletin of the Iranian Mathematical Society (2014) 541-564
68	A predictor-corrector interior-point algorithm for P*(?)-horizontal linear complementarity problem	Numerical Algorithms (2014) 349-361
69	A WEIGHTED-PATH-FOLLOWING METHOD FOR SYMMETRIC CONE LINEAR COMPLEMENTARITY PROBLEMS	Numerical Algebra,Control And Optimization 4 (2014) 141-150
70	A new infeasible interior-point algorithm with full Nesterov-Todd step for semi-definite optimization	Iranian J. Oper. Res (2014) 88-107
71	A new interior-point algorithm based on modified Nesterov–Todd direction for symmetric cone linear complementarity problem	Optim Lett (2014) 1017-1029
72	A predictor-corrector path-following algorithm for symmetric optimization based on Darvay’s technique	Yugoslav J. Oper. Res. (2014) 35-51
73	A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function	Numerical Algebra,Control And Optimization (2013) 601-614
74	A new infeasible interior-point method based on Darvay’s technique for symmetric optimization	Annals of Operations Research (2013) -
75	A modified full-Newton step infeasible interior-point algorithm for linear optimization	ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2013) -
76	A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization	J. Oper. Res.Society China (2013) 467-481
77	New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization	Kybernetika (2013) 883-896
78	A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function	J. Oper. res. Society China (2013) 359-376
79	The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers	Fuzzy Optimization and Decision Making (2013) 171-189
80	Second order duality in fuzzy mathematical programming with fuzzy coefficients	Fuzzy Information and Engineering (2013) 147-158
81	Multi-parametric sensitivity analysis in active constraints set of convex quadratic optimization	Pacific Journal of Optimization (2012) 93-102
82	Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term	Numerical Algorithms (2012) 659-680
83	Strict sensitivity analysis in fuzzy quadratic programming	FUZZY SETS AND SYSTEMS (2012) 111-99
84	Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step	Numerical Algorithms (2012) 606-589
85	"Column generation in linear programming with trapezoidal fuzzy variables " Annals of Fuzzy mathematicas and Information VOL.3 ، No. 2 ، (Aprial 2012 ) ، PP. 293-303 .	FUZZY SETS AND SYSTEMS (2012) 303-293
86	A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity	ANZIAM JOURNAL (2011) 67-48
87	A method for silving fully fuzzy quadratic programming problems	Acta univedrsitatis apulensis (2011) 69
88	Multi-parametric linear optimization invariant active constraints set	Pacific Journal of Optimization (2011) 163

بهروز خیرفام