Petra Renáta Rigó
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
Petra Renáta Rigó has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Tibor Illés
Corvinus Centre for Operations Research at Corvinus Institute for Advanced Studies, Corvinus University of Budapest, 1093 Budapest, Hungary
8 shared publications - Zsolt Darvay
Babes-Bolyai University
4 shared publications - Marianna E.-Nagy
Corvinus Centre for Operations Research at Corvinus Institute for Advanced Studies, Corvinus University of Budapest, 1093 Budapest, Hungary
3 shared publications Roland Török
2 shared publications- Sorin-Mihai Grad
Faculty of Mathematics, University of Duisburg-Essen, Essen, Germany
2 shared publications - Anita Varga
Department of Mathematics, North Carolina State University, Raleigh, NC 27607 USA
1 shared publication
Latest Publications
- 12 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems (LCPs). The first algorithm is based on a universal tangent direction, which has been recently proposed for linear optimization problems. We prove that this method has the best-known worst-case complexity bound. We extend onto this LCP its auto-correcting version proposed by Nesterov and prove its local quadratic convergence under the assumption of the existence of a unique and strictly complementarity solution. In our numerical experiments, we compare the new algorithms with a general method, recently developed for weighted monotone linear complementarity problems. Funding: This research was supported by the National Research, Development and Innovation Office (NKFIH) [Grant 2024-1.2.3-HU-RIZONT-2024-00030]. The research of M. E.-Nagy and P. R. Rigó was individually supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) [Grants 2024-2027 and 2025-2028, respectively].
- 12 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems (LCPs). The first algorithm is based on a universal tangent direction, which has been recently proposed for linear optimization problems. We prove that this method has the best-known worst-case complexity bound. We extend onto this LCP its auto-correcting version proposed by Nesterov and prove its local quadratic convergence under the assumption of the existence of a unique and strictly complementarity solution. In our numerical experiments, we compare the new algorithms with a general method, recently developed for weighted monotone linear complementarity problems. Funding: This research was supported by the National Research, Development and Innovation Office (NKFIH) [Grant 2024-1.2.3-HU-RIZONT-2024-00030]. The research of M. E.-Nagy and P. R. Rigó was individually supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) [Grants 2024-2027 and 2025-2028, respectively].
- Open Access
- 2 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 53-67
New computable algorithms for smooth multiobjective optimization problems
- 2 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 53-67
Open AccessNew computable algorithms for smooth multiobjective optimization problems
- 27 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (2) , 887-911
Comprehensive Analysis of Kernel-Based Interior-Point Methods for the \({P}_{{*}}{(\kappa )}\)-LCPWe present an interior-point algorithm for [Formula: see text]-linear complementarity problems, based on a barrier function defined by a new class of univariate kernel functions, called standard kernel functions (SKFs). A comprehensive and unified complexity analysis of the algorithm is provided, and a general procedure is developed to determine the iteration bounds for long-step and short-step versions of the method for the entire class of SKFs. We illustrate the general procedure by determining the iteration bounds for several parametric SKFs, which include, as special cases, all eligible kernel functions from the literature that have rational or exponential barrier terms. In all cases, we match the best iteration bounds obtained in the literature for these special cases of SKFs.
- 27 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (2) , 887-911
Comprehensive Analysis of Kernel-Based Interior-Point Methods for the \({P}_{{*}}{(\kappa )}\)-LCPWe present an interior-point algorithm for [Formula: see text]-linear complementarity problems, based on a barrier function defined by a new class of univariate kernel functions, called standard kernel functions (SKFs). A comprehensive and unified complexity analysis of the algorithm is provided, and a general procedure is developed to determine the iteration bounds for long-step and short-step versions of the method for the entire class of SKFs. We illustrate the general procedure by determining the iteration bounds for several parametric SKFs, which include, as special cases, all eligible kernel functions from the literature that have rational or exponential barrier terms. In all cases, we match the best iteration bounds obtained in the literature for these special cases of SKFs.
- Open Access
- 12 August 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 219 (1-2) , 1-30
Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
We revisit the main principles for constructing polynomial-time primal-dual interior-point algorithms (IPAs). We investigate the weighted Linear Complementarity Problem (WLCP), by extending the framework of Parabolic Target Space (PTS), proposed by Nesterov (2008) for primal-dual Linear Programming (LP) Problems. This approach has several advantages. The proposed method based on the PTS approach starts from an arbitrary strictly feasible primal-dual pair and follows a single central path toward the solution. It has the best known worst-case complexity bound. Finally, it works in a large neighborhood of the deviated central path, allowing very large steps. The latter ability results in a significant acceleration at the end of the process, confirmed by our preliminary computational experiments.
- 12 August 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 219 (1-2) , 1-30
Open AccessParabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
We revisit the main principles for constructing polynomial-time primal-dual interior-point algorithms (IPAs). We investigate the weighted Linear Complementarity Problem (WLCP), by extending the framework of Parabolic Target Space (PTS), proposed by Nesterov (2008) for primal-dual Linear Programming (LP) Problems. This approach has several advantages. The proposed method based on the PTS approach starts from an arbitrary strictly feasible primal-dual pair and follows a single central path toward the solution. It has the best known worst-case complexity bound. Finally, it works in a large neighborhood of the deviated central path, allowing very large steps. The latter ability results in a significant acceleration at the end of the process, confirmed by our preliminary computational experiments.
- Open Access
New computable algorithms for smooth multiobjective optimization problems
We propose new practical algorithms for solving smooth multiobjective optimization problems based on determining joint decreasing directions via suitable linear programming problems. The presented iterative method is specialized for unconstrained, sign constrained and linearly constrained multiobjective optimization problems. In all cases we show that the objective function values sequence is decreasing with respect to the considered nonnegative orthant while the iterates are feasible. Furthermore, we prove that every accumulation point of the sequence generated by the algorithm, if any, is a substationary point to the considered multiobjective optimization problem, and, under convexity assumptions, it is actually a weakly Pareto efficient (also known as weakly Pareto-optimal) point. Different to similar algorithms from the literature, the ones proposed in this work involve joint decreasing directions that are easily computable in polynomial time by solving linear programming problems. The computational performance of our algorithms has been illustrated on convex unconstrained and convex linearly constrained multiobjective optimization problems.
Open AccessNew computable algorithms for smooth multiobjective optimization problems
We propose new practical algorithms for solving smooth multiobjective optimization problems based on determining joint decreasing directions via suitable linear programming problems. The presented iterative method is specialized for unconstrained, sign constrained and linearly constrained multiobjective optimization problems. In all cases we show that the objective function values sequence is decreasing with respect to the considered nonnegative orthant while the iterates are feasible. Furthermore, we prove that every accumulation point of the sequence generated by the algorithm, if any, is a substationary point to the considered multiobjective optimization problem, and, under convexity assumptions, it is actually a weakly Pareto efficient (also known as weakly Pareto-optimal) point. Different to similar algorithms from the literature, the ones proposed in this work involve joint decreasing directions that are easily computable in polynomial time by solving linear programming problems. The computational performance of our algorithms has been illustrated on convex unconstrained and convex linearly constrained multiobjective optimization problems.
- Open Access
- 16 April 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (1) , 1-25
Gradient projection method on the sphere, complementarity problems and copositivity
By using a constant step-size, the convergence analysis of the gradient projection method on the sphere is presented for a closed spherically convex set. This algorithm is applied to discuss copositivity of operators with respect to cones. This approach can also be used to analyse solvability of nonlinear cone-complementarity problems. To our best knowledge this is the first numerical method related to the copositivity of operators with respect to the positive semidefinite cone. Numerical results concerning the copositivity of operators are also provided.
- 16 April 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (1) , 1-25
Open AccessGradient projection method on the sphere, complementarity problems and copositivity
By using a constant step-size, the convergence analysis of the gradient projection method on the sphere is presented for a closed spherically convex set. This algorithm is applied to discuss copositivity of operators with respect to cones. This approach can also be used to analyse solvability of nonlinear cone-complementarity problems. To our best knowledge this is the first numerical method related to the copositivity of operators with respect to the positive semidefinite cone. Numerical results concerning the copositivity of operators are also provided.
- Open Access
- 4 August 2023
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 11
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- 4 August 2023
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 11
Open AccessLarge-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Open Access
- 22 June 2023
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 469
The construction of multidimensional membership functions and its application to feasibility problems
- 22 June 2023
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 469
Open AccessThe construction of multidimensional membership functions and its application to feasibility problems
- Open Access
- 13 June 2023
- Published by Springer Nature in Optimization Letters
- Vol. 18 (2) , 615-634
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
We generalize a primal-dual interior-point algorithm (IPA) proposed recently in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) to $$P_*(\kappa )$$ -horizontal linear complementarity problems (LCPs) over Cartesian product of symmetric cones. The algorithm is based on the algebraic equivalent transformation (AET) technique with a new class of AET functions. The new class is a modification of the class of AET functions proposed in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) where only two conditions are used as opposed to three used in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022). Furthermore, the algorithm is a feasible algorithm that uses full Nesterov-Todd steps, hence, no calculation of step-size is necessary. Nevertheless, we prove that the proposed IPA has the iteration bound that matches the best known iteration bound for IPAs solving these types of problems.- 13 June 2023
- Published by Springer Nature in Optimization Letters
- Vol. 18 (2) , 615-634
Open AccessInterior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
We generalize a primal-dual interior-point algorithm (IPA) proposed recently in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) to $$P_*(\kappa )$$ -horizontal linear complementarity problems (LCPs) over Cartesian product of symmetric cones. The algorithm is based on the algebraic equivalent transformation (AET) technique with a new class of AET functions. The new class is a modification of the class of AET functions proposed in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) where only two conditions are used as opposed to three used in (Illés T, Rigó PR, Török R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022). Furthermore, the algorithm is a feasible algorithm that uses full Nesterov-Todd steps, hence, no calculation of step-size is necessary. Nevertheless, we prove that the proposed IPA has the iteration bound that matches the best known iteration bound for IPAs solving these types of problems.