Joaquim Dias Garcia

Joaquim Dias Garcia

Auto-generated profile, based on publicly available information

Joaquim Dias Garcia

PSR Rio de Janeiro Brazil

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 June 2023 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
MLMiles Lubin
Miles Lubin
ODOscar Dowson
Oscar Dowson
JGJoaquim Dias Garcia
Joaquim Dias Garcia
JHJoey Huchette
Joey Huchette
BLBenoît Legat
Benoît Legat
JVJuan Pablo Vielma
Juan Pablo Vielma

1 March 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
BLBenoît Legat
Benoît Legat
ODOscar Dowson
Oscar Dowson
JGJoaquim Dias Garcia
Joaquim Dias Garcia
MLMiles Lubin
Miles Lubin
We introduce MathOptInterface, an abstract data structure for representing mathematical optimization problems based on combining predefined functions and sets. MathOptInterface is significantly more general than existing data structures in the literature, encompassing, for example, a spectrum of problems classes from integer programming with indicator constraints to bilinear semidefinite programming. We also outline an automated rewriting system between equivalent formulations of a constraint. MathOptInterface has been implemented in practice, forming the foundation of a recent rewrite of JuMP, an open-source algebraic modeling language in the Julia language. The regularity of the MathOptInterface representation leads naturally to a general file format for mathematical optimization we call MathOptFormat. In addition, the automated rewriting system provides modeling power to users while making it easy to connect new solvers to JuMP. Summary of Contribution: This paper describes a new abstract data structure for representing mathematical optimization models with a corresponding file format and automatic transformation system. The advances are useful for algebraic modeling languages, allowing practitioners to model problems more naturally and more generally than before.

8 July 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
LCLuiz Carlos da Costa
Luiz Carlos da Costa
FTFernanda Souza Thome
Fernanda Souza Thome
JGJoaquim Dias Garcia
Joaquim Dias Garcia
MPMario V. F. Pereira
Mario V. F. Pereira
This work presents a methodology to incorporate reliability constraints in the optimal power systems expansion planning problem. Besides Loss Of Load Probability (LOLP) and Expected Power Not Supplied (EPNS), traditionally used in power systems, this work proposes the use of the risk measures VaR (Value-at-Risk) and CVaR (Conditional Value-at-Risk), widely used in financial markets. The explicit consideration of reliability constraints in the planning problem can be an extremely hard task and, to minimize computational effort, this work applies the Benders decomposition technique splitting the expansion planning problem into an investment problem and two subproblems to evaluate the system's operation cost and the reliability index. The operation subproblem is solved by Stochastic Dual Dynamic Programming (SDDP) and the reliability subproblem by Monte Carlo simulation. The proposed methodology is applied to the real problem of optimal expansion planning of the Bolivian power system.

18 May 2016 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
JWJean Pierre von der Weid
Jean Pierre von der Weid
MSMario H. Souto
Mario H. Souto
JGJoaquim D. Garcia
Joaquim D. Garcia
GAGustavo Castro do Amaral
Gustavo Castro do Amaral
We present a novel methodology that is able to distinguish meaningful level shifts from typical signal fluctuations which, in a fiber monitoring context, is associated with the problem of identifying small losses within a noisy optical time-domain reflectometer (OTDR) profile. A two-stage regularization filtering can accurately identify the location of the significant level shifts with an efficient parameter-free algorithm. The developed methodology demands low computational effort and can easily be embedded in a dedicated processing unit. Our case studies compare the new methodology with the current available ones and show that it is the most adequate technique for fast detection of multiple unknown level shifts in a noisy OTDR profile.

19 October 2020 in Optimization
Verified
Journal Article
Closed access
MSMario Souto
Mario Souto
JGJoaquim D. Garcia
Joaquim D. Garcia
ÁVÁlvaro Veiga
Álvaro Veiga
In contrast to many other convex optimization classes, state-of-the-art semidefinite programming solvers are still unable to efficiently solve large-scale instances. This work aims to reduce this scalability gap by proposing a novel proximal algorithm for solving general semidefinite programming problems. The key characteristic of the proposed algorithm is to be able to exploit the low-rank property inherent to several semidefinite programming problems. Exploiting the low-rank structure provides a substantial speedup and allows the operator splitting method to efficiently scale to larger instances. As opposed to other low-rank based methods, the proposed algorithm has convergence guarantees for general semidefinite programming problems. Additionally, an open-source semidefinite programming solver called ProxSDP is made available and its implementation details are discussed. Case studies are presented in order to evaluate the performance of the proposed methodology.

1 January 2025 in Operations Research
Verified
Journal Article
Closed access
JGJoaquim Dias Garcia
Joaquim Dias Garcia
ASAlexandre Street
Alexandre Street
THTito Homem-De-Mello
Tito Homem-De-Mello
FMFrancisco D. Muñoz
Francisco D. Muñoz
Application-Driven Learning: Closing the Loop Between the Application and the Estimation of Forecast Models This paper introduces a closed-loop framework called application-driven learning, where the best forecast model is tailored to the application cost structure. Our methodology employs two-stage optimization schemes to derive multivariate point forecasts. The estimation problem is conceived as a bilevel model, and we propose two solution methodologies: an exact one using KKT conditions and a scalable decomposition heuristic. This approach offers a scientifically grounded alternative to ad hoc demand biasing approaches and reserve requirement rules currently adopted by power system operators worldwide. Testing with real data and large-scale systems demonstrates that our methodology consistently outperforms traditional open-loop methods, providing significant potential benefits for energy system operations.