Jordi Castro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jordi Castro has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- José Antonio González
Universidad Politecnica de Cataluña
5 shared publications - Claudio Gentile
Consiglio Nazionale delle Ricerche
4 shared publications Daniel Baena
Universitat Politecnica de Catalunya
4 shared publications- Daniel Baena
Department of Statistics and Operations Research, Universitat Politècnica de Catalunya, UPC, Barcelona, Catalonia
3 shared publications N. Nabona
3 shared publications- Stefano Nasini
IÉSEG School of Management
3 shared publications
Latest Publications
- 17 September 2026
- Published by Springer Nature
- p. 57-65
Optimal Microaggregation using Medoids
- Open Access
- 1 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 177-191
An extension of an interior-point method to include risk aversion in large-scale multistage stochastic optimization
- 1 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 177-191
Open AccessAn extension of an interior-point method to include risk aversion in large-scale multistage stochastic optimization
- Open Access
- 13 February 2026
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 12 (1) , 1-7
Optimal Power Flow Problem Using Interior-Point Method with Block Structure
This work focuses on optimizing power flow in the electrical sector, considering uncertainties in energy demand, to minimize costs and energy loss, within the constraints of the physical network. We use a two-stage stochastic programming, creating discrete scenarios associated with the uncertainty of demand. The problem is solved using MSSO-BlockIP, a specialized software employing the Interior-Point Method for stochastic programming. The work presents the mathematical formulation using splitting variables and provides computational results, comparing this approach with a traditional one. The findings indicate that the proposed method yields solutions consistent with Gurobi, achieving notable improvements in terms of running time and the number of iterations.
- 13 February 2026
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 12 (1) , 1-7
Open AccessOptimal Power Flow Problem Using Interior-Point Method with Block Structure
This work focuses on optimizing power flow in the electrical sector, considering uncertainties in energy demand, to minimize costs and energy loss, within the constraints of the physical network. We use a two-stage stochastic programming, creating discrete scenarios associated with the uncertainty of demand. The problem is solved using MSSO-BlockIP, a specialized software employing the Interior-Point Method for stochastic programming. The work presents the mathematical formulation using splitting variables and provides computational results, comparing this approach with a traditional one. The findings indicate that the proposed method yields solutions consistent with Gurobi, achieving notable improvements in terms of running time and the number of iterations.
- Open Access
- 1 January 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (2) , 861-873
A new mathematical optimization-based method for the m-invariance problem
Privacy preserving dynamic data publication aims at protecting data while simultaneously preserving its utility when the data is published dynamically. For static data (i.e., data published only once), privacy is based on concepts such as k-anonymity and $$\epsilon $$ -differential privacy. In contrast, for dynamic data, the notions of m-invariance and $$\tau $$ -safety are considered. However, most current approaches focus solely on guaranteeing m-invariance and $$\tau $$ -safety without paying attention to the quality of the solution, such as maximizing utility. We propose a new heuristic approach for the NP-hard combinatorial problem of m-invariance and $$\tau $$ -safety, which is based on a mathematical optimization column generation scheme. The quality of a solution to m-invariance and $$\tau $$ -safety can be measured by the Information Loss (IL), a value in [0, 100], the closer to 0 the better. We show that our approach improves by far current heuristics, reducing IL by more than $$60\%$$ and, in some instances, by more than $$95\%$$ .- 1 January 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (2) , 861-873
Open AccessA new mathematical optimization-based method for the m-invariance problem
Privacy preserving dynamic data publication aims at protecting data while simultaneously preserving its utility when the data is published dynamically. For static data (i.e., data published only once), privacy is based on concepts such as k-anonymity and $$\epsilon $$ -differential privacy. In contrast, for dynamic data, the notions of m-invariance and $$\tau $$ -safety are considered. However, most current approaches focus solely on guaranteeing m-invariance and $$\tau $$ -safety without paying attention to the quality of the solution, such as maximizing utility. We propose a new heuristic approach for the NP-hard combinatorial problem of m-invariance and $$\tau $$ -safety, which is based on a mathematical optimization column generation scheme. The quality of a solution to m-invariance and $$\tau $$ -safety can be measured by the Information Loss (IL), a value in [0, 100], the closer to 0 the better. We show that our approach improves by far current heuristics, reducing IL by more than $$60\%$$ and, in some instances, by more than $$95\%$$ . - Open Access
- 7 June 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (8) , 1757-1790
The Chebyshev center as an alternative to the analytic center in the feasibility pump
As a heuristic for obtaining feasible points of mixed integer linear problems, the feasibility pump (FP) generates two sequences of points: one of feasible solutions for the relaxed linear problem; and another of integer points obtained by rounding the linear solutions. In a previous work, the present authors proposed a variant of FP, named analytic center FP, which obtains integer solutions by rounding points in the segment between the linear solution and the analytic center of the polyhedron of the relaxed problem. This work introduces a new FP variant that replaces the analytic center with the Chebyshev center. Two of the benefits of using the Chebyshev center are: (i) it requires the solution of a linear optimization problem (unlike the analytic center, which involves a convex nonlinear optimization problem for its exact solution); and (ii) it is invariant to redundant constraints (unlike the analytic center, which may not be well centered within the polyhedron for problems with highly rank-deficient matrices). The computational results obtained with a set of more than 200 MIPLIB2003 and MIPLIB2010 instances show that the Chebyshev center FP is competitive and can serve as an alternative to other FP variants.
- 7 June 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (8) , 1757-1790
Open AccessThe Chebyshev center as an alternative to the analytic center in the feasibility pump
As a heuristic for obtaining feasible points of mixed integer linear problems, the feasibility pump (FP) generates two sequences of points: one of feasible solutions for the relaxed linear problem; and another of integer points obtained by rounding the linear solutions. In a previous work, the present authors proposed a variant of FP, named analytic center FP, which obtains integer solutions by rounding points in the segment between the linear solution and the analytic center of the polyhedron of the relaxed problem. This work introduces a new FP variant that replaces the analytic center with the Chebyshev center. Two of the benefits of using the Chebyshev center are: (i) it requires the solution of a linear optimization problem (unlike the analytic center, which involves a convex nonlinear optimization problem for its exact solution); and (ii) it is invariant to redundant constraints (unlike the analytic center, which may not be well centered within the polyhedron for problems with highly rank-deficient matrices). The computational results obtained with a set of more than 200 MIPLIB2003 and MIPLIB2010 instances show that the Chebyshev center FP is competitive and can serve as an alternative to other FP variants.
- Open Access
- 5 April 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 310 (1) , 268-285
On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach
- 5 April 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 310 (1) , 268-285
Open AccessOn solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach
- Open Access
- 29 September 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 237-270
New Interior-Point Approach for One- and Two-Class Linear Support Vector Machines Using Multiple Variable Splitting
Multiple variable splitting is a general technique for decomposing problems by using copies of variables and additional linking constraints that equate their values. The resulting large optimization problem can be solved with a specialized interior-point method that exploits the problem structure and computes the Newton direction with a combination of direct and iterative solvers (i.e. Cholesky factorizations and preconditioned conjugate gradients for linear systems related to, respectively, subproblems and new linking constraints). The present work applies this method to solving real-world binary classification and novelty (or outlier) detection problems by means of, respectively, two-class and one-class linear support vector machines (SVMs). Unlike previous interior-point approaches for SVMs, which were practical only with low-dimensional points, the new proposal can also deal with high-dimensional data. The new method is compared with state-of-the-art solvers for SVMs that are based on either interior-point algorithms (such as SVM-OOPS) or specific algorithms developed by the machine learning community (such as LIBSVM and LIBLINEAR). The computational results show that, for two-class SVMs, the new proposal is competitive not only against previous interior-point methods—and much more efficient than they are with high-dimensional data—but also against LIBSVM, whereas LIBLINEAR generally outperformed the proposal. For one-class SVMs, the new method consistently outperformed all other approaches, in terms of either solution time or solution quality.
- 29 September 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 237-270
Open AccessNew Interior-Point Approach for One- and Two-Class Linear Support Vector Machines Using Multiple Variable Splitting
Multiple variable splitting is a general technique for decomposing problems by using copies of variables and additional linking constraints that equate their values. The resulting large optimization problem can be solved with a specialized interior-point method that exploits the problem structure and computes the Newton direction with a combination of direct and iterative solvers (i.e. Cholesky factorizations and preconditioned conjugate gradients for linear systems related to, respectively, subproblems and new linking constraints). The present work applies this method to solving real-world binary classification and novelty (or outlier) detection problems by means of, respectively, two-class and one-class linear support vector machines (SVMs). Unlike previous interior-point approaches for SVMs, which were practical only with low-dimensional points, the new proposal can also deal with high-dimensional data. The new method is compared with state-of-the-art solvers for SVMs that are based on either interior-point algorithms (such as SVM-OOPS) or specific algorithms developed by the machine learning community (such as LIBSVM and LIBLINEAR). The computational results show that, for two-class SVMs, the new proposal is competitive not only against previous interior-point methods—and much more efficient than they are with high-dimensional data—but also against LIBSVM, whereas LIBLINEAR generally outperformed the proposal. For one-class SVMs, the new method consistently outperformed all other approaches, in terms of either solution time or solution quality.
- 14 September 2022
- Published by Springer Nature
- p. 3-14
An Optimization-Based Decomposition Heuristic for the Microaggregation Problem
- 14 September 2022
- Published by Springer Nature
- p. 3-14
An Optimization-Based Decomposition Heuristic for the Microaggregation Problem
- 4 April 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 144
An algorithm for the microaggregation problem using column generation
- 4 April 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 144
An algorithm for the microaggregation problem using column generation
- 1 May 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 290 (3) , 857-869
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- 1 May 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 290 (3) , 857-869
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks