Csaba I. Fábián
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Csaba I. Fábián has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Diana Roman
Brunel University
3 shared publications Achim Koberstein
2 shared publicationsChristian Wolf
2 shared publications- Edit Csizmás
Kecskemét College, GAMF, Department of Informatics, Izsáki 10, 6000 Kecskemét, Hungary
2 shared publications Gautam Mitra
OptiRisk Systems, OptiRisk R&D House
2 shared publications- Gautam Mitra
Brunel University
2 shared publications
Latest Publications
- Open Access
- 5 May 2022
- Published by Springer Nature in Computational Management Science
- Vol. 19 (4) , 539-565
An L-shaped method with strengthened lift-and-project cuts
Lift-and-project (L &P) cuts are well-known general 0–1 programming cuts which are typically deployed in branch-and-cut methods to solve MILP problems. In this article, we discuss ways to use these cuts within the framework of Benders’ decomposition algorithms for solving two-stage mixed-binary stochastic problems with binary first-stage variables and continuous recourse. In particular, we show how L &P cuts derived for the master problem can be strengthened with the second-stage information. An adapted L-shaped algorithm and its computational efficiency analysis is presented. We show that the strengthened L &P cuts can significantly reduce the number of iterations and the solution time.
- 5 May 2022
- Published by Springer Nature in Computational Management Science
- Vol. 19 (4) , 539-565
Open AccessAn L-shaped method with strengthened lift-and-project cuts
Lift-and-project (L &P) cuts are well-known general 0–1 programming cuts which are typically deployed in branch-and-cut methods to solve MILP problems. In this article, we discuss ways to use these cuts within the framework of Benders’ decomposition algorithms for solving two-stage mixed-binary stochastic problems with binary first-stage variables and continuous recourse. In particular, we show how L &P cuts derived for the master problem can be strengthened with the second-stage information. An adapted L-shaped algorithm and its computational efficiency analysis is presented. We show that the strengthened L &P cuts can significantly reduce the number of iterations and the solution time.
- Open Access
- 17 July 2020
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 29 (2) , 491-519
Gaining traction: on the convergence of an inner approximation scheme for probability maximization
We analyze an inner approximation scheme for probability maximization. The approach was proposed in Fábián et al. (Acta Polytech Hung 15:105–125, 2018), as an analogue of a classic dual approach in the handling of probabilistic constraints. Even a basic implementation of the maximization scheme proved usable and endured noise in gradient computations without any special effort. Moreover, the speed of convergence was not affected by approximate computation of test points. This robustness was then explained in an idealized setting. Here we work out convergence proofs and efficiency arguments for a nondegenerate normal distribution. The main message of the present paper is that the procedure gains traction as an optimal solution is approached.
- 17 July 2020
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 29 (2) , 491-519
Open AccessGaining traction: on the convergence of an inner approximation scheme for probability maximization
We analyze an inner approximation scheme for probability maximization. The approach was proposed in Fábián et al. (Acta Polytech Hung 15:105–125, 2018), as an analogue of a classic dual approach in the handling of probabilistic constraints. Even a basic implementation of the maximization scheme proved usable and endured noise in gradient computations without any special effort. Moreover, the speed of convergence was not affected by approximate computation of test points. This robustness was then explained in an idealized setting. Here we work out convergence proofs and efficiency arguments for a nondegenerate normal distribution. The main message of the present paper is that the procedure gains traction as an optimal solution is approached.
- Open Access
- 21 January 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 354 (3) , 1073-1104
A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
We propose a randomized gradient method for handling a convex function whose gradient computation is demanding. The method bears a resemblance to the stochastic approximation family. But in contrast to stochastic approximation, the present method builds a model problem. The approach is adapted to probability maximization and probabilistic constrained problems. We discuss simulation procedures for gradient estimation.
- 21 January 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 354 (3) , 1073-1104
Open AccessA randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
We propose a randomized gradient method for handling a convex function whose gradient computation is demanding. The method bears a resemblance to the stochastic approximation family. But in contrast to stochastic approximation, the present method builds a model problem. The approach is adapted to probability maximization and probabilistic constrained problems. We discuss simulation procedures for gradient estimation.
- Open Access
- 1 October 2016
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 23 (5) , 1469-1474
Parameters of the intelligent driver model in signalized intersections
U ovom su radu kalibrirani nepromjenjivi parametri Modela inteligentnog vozača (auta koji slijedi) kako bi se dobila točna propusna moć signaliziranog križanja. Kalibriranje se zasniva na izmjerenim parametrima intervala između...
- 1 October 2016
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 23 (5) , 1469-1474
Open AccessParameters of the intelligent driver model in signalized intersections
U ovom su radu kalibrirani nepromjenjivi parametri Modela inteligentnog vozača (auta koji slijedi) kako bi se dobila točna propusna moć signaliziranog križanja. Kalibriranje se zasniva na izmjerenim parametrima intervala između...
- 1 January 2015
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 25 (1) , 28-52
Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study
We extend the on-demand accuracy approach of Oliveira and Sagastizábal to constrained convex optimization. The resulting method is applied to risk-averse two-stage stochastic programming problems. We present a survey of risk-averse models. The appropriate oracle is formulated for the case of a conditional value-at-risk constraint. We discuss computational aspects and compare different approaches in a study.
- 1 January 2015
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 25 (1) , 28-52
Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study
We extend the on-demand accuracy approach of Oliveira and Sagastizábal to constrained convex optimization. The resulting method is applied to risk-averse two-stage stochastic programming problems. We present a survey of risk-averse models. The appropriate oracle is formulated for the case of a conditional value-at-risk constraint. We discuss computational aspects and compare different approaches in a study.
- 1 December 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 239 (2) , 437-448
Applying oracles of on-demand accuracy in two-stage stochastic programming – A computational study
- 1 December 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 239 (2) , 437-448
Applying oracles of on-demand accuracy in two-stage stochastic programming – A computational study
- 9 March 2014
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 23 (4) , 877-898
A regularized simplex method
- 9 March 2014
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 23 (4) , 877-898
A regularized simplex method
- 30 April 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 56 (2) , 343-368
Implementing the simplex method as a cutting-plane method, with a view to regularization
- 30 April 2013
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 56 (2) , 343-368
Implementing the simplex method as a cutting-plane method, with a view to regularization
- 5 May 2012
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 4 (3) , 211-238
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- 5 May 2012
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 4 (3) , 211-238
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- 1 October 2011
- Published by Taylor & Francis in Quantitative Finance
- Vol. 11 (10) , 1525-1534
An enhanced model for portfolio choice with SSD criteria: a constructive approach
We formulate a portfolio planning model that is based on second-order stochastic dominance as the choice criterion. This model is an enhanced version of the multi-objective model proposed by Roman et al. [Math. Progr. Ser. B, 2006, 108, 541–569]; the model compares the scaled values of the different objectives, representing tails at different confidence levels of the resulting distribution. The proposed model can be formulated as a risk minimization model where the objective function is a convex risk measure; we characterize this risk measure and the resulting optimization problem. Moreover, our formulation offers a natural generalization of the SSD-constrained model of Dentcheva and Ruszczyński [J. Bank. Finance, 2006, 30, 433–451]. A cutting plane-based solution method for the proposed model is outlined. We present a computational study showing: (a) the effectiveness of the solution methods and (b) the improved modeling capabilities: the resulting portfolios have superior return distributions.
- 1 October 2011
- Published by Taylor & Francis in Quantitative Finance
- Vol. 11 (10) , 1525-1534
An enhanced model for portfolio choice with SSD criteria: a constructive approach
We formulate a portfolio planning model that is based on second-order stochastic dominance as the choice criterion. This model is an enhanced version of the multi-objective model proposed by Roman et al. [Math. Progr. Ser. B, 2006, 108, 541–569]; the model compares the scaled values of the different objectives, representing tails at different confidence levels of the resulting distribution. The proposed model can be formulated as a risk minimization model where the objective function is a convex risk measure; we characterize this risk measure and the resulting optimization problem. Moreover, our formulation offers a natural generalization of the SSD-constrained model of Dentcheva and Ruszczyński [J. Bank. Finance, 2006, 30, 433–451]. A cutting plane-based solution method for the proposed model is outlined. We present a computational study showing: (a) the effectiveness of the solution methods and (b) the improved modeling capabilities: the resulting portfolios have superior return distributions.