activity
20142024
most citedA novel embedded min-max approach for feature selection in nonlinear support vector machine classification

85 citations · 116 across the 22 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

math.OC2021★ 17 cited

Prescribing net demand for two-stage electricity generation scheduling

Juan M. Morales, Miguel Á. Muñoz, Salvador Pineda

We consider a two-stage generation scheduling problem comprising a forward dispatch and a real-time re-dispatch. The former must be conducted facing an uncertain net demand that in…

stat.ME2021

A Functional Data Analysis Approach to Evolution Outlier Detection for Grouped Smart Meters

A. Elías, J. M. Morales, S. Pineda

Smart metering infrastructures collect data almost continuously in the form of fine-grained long time series. These massive data series often have common daily patterns that are re…

math.OC2021

Is learning for the unit commitment problem a low-hanging fruit?

S. Pineda, J. M. Morales

The blast wave of machine learning and artificial intelligence has also reached the power systems community, and amid the frenzy of methods and black-box tools that have been left…

math.OC2021

Learning the price response of active distribution networks for TSO-DSO coordination

Juan Miguel Morales, Salvador Pineda, Yury Dvorkin

The increase in distributed energy resources and flexible electricity consumers has turned TSO-DSO coordination strategies into a challenging problem. Existing decomposition/decent…

math.OC2021

Cost-driven Screening of Network Constraints for the Unit Commitment Problem

Álvaro Porras, Salvador Pineda, Juan M. Morales +1

In an attempt to speed up the solution of the unit commitment (UC) problem, both machine-learning and optimization-based methods have been proposed to lighten the full UC formulati…

math.OC2021★ 4 cited

Warm-starting constraint generation for mixed-integer optimization: A Machine Learning approach

Asunción Jiménez-Cordero, Juan Miguel Morales, Salvador Pineda

Mixed Integer Linear Programs (MILP) are well known to be NP-hard (Non-deterministic Polynomial-time hard) problems in general. Even though pure optimization-based methods, such as…