Welington de Oliveira

Affiliations:
  • MINES ParisTech, PSL Research University, CMA Centre de Mathématiques Appliquées, France


According to our database1, Welington de Oliveira authored at least 28 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
S-BORM: Reliability-based optimization of general systems using buffered optimization and reliability method.
Reliab. Eng. Syst. Saf., August, 2023

Short Paper - A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems.
Open J. Math. Optim., January, 2023

2022
Addendum to the paper 'Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies'.
Optim. Methods Softw., 2022

A derivative-free trust-region algorithm with copula-based models for probability maximization problems.
Eur. J. Oper. Res., 2022

2021
A bundle method for nonsmooth DC programming with application to chance-constrained problems.
Comput. Optim. Appl., 2021

2020
Some brief observations in minimizing the sum of locally Lipschitzian functions.
Optim. Lett., 2020

Asynchronous level bundle methods.
Math. Program., 2020

Sequential Difference-of-Convex Programming.
J. Optim. Theory Appl., 2020

A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem.
Comput. Optim. Appl., 2020

A Mixed-Integer and Asynchronous Level Decomposition with Application to the Stochastic Hydrothermal Unit-Commitment Problem.
Algorithms, 2020

A Stochastic Optimization Model for Frequency Control and Energy Management in a Microgrid.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020

2019
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies.
Optim. Methods Softw., 2019

Nonsmooth and Nonconvex Optimization via Approximate Difference-of-Convex Decompositions.
J. Optim. Theory Appl., 2019

Proximal bundle methods for nonsmooth DC programming.
J. Glob. Optim., 2019

On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems.
Comput. Optim. Appl., 2019

Robust Design of Pumping Stations in Water Distribution Networks.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2018
Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse.
INFORMS J. Comput., 2018

2017
Target radius methods for nonsmooth convex optimization.
Oper. Res. Lett., 2017

Uncontrolled inexact information within bundle methods.
EURO J. Comput. Optim., 2017

Probabilistic optimization via approximate p-efficient points and bundle methods.
Comput. Oper. Res., 2017

2016
A doubly stabilized bundle method for nonsmooth convex optimization.
Math. Program., 2016

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support.
Comput. Optim. Appl., 2016

2014
Level bundle methods for oracles with on-demand accuracy.
Optim. Methods Softw., 2014

Convex proximal bundle methods in depth: a unified analysis for inexact oracles.
Math. Program., 2014

Level bundle-like algorithms for convex optimization.
J. Glob. Optim., 2014

Level bundle methods for constrained convex optimization with various oracles.
Comput. Optim. Appl., 2014

2011
Inexact Bundle Methods for Two-Stage Stochastic Programming.
SIAM J. Optim., 2011

2010
Optimal scenario tree reduction for stochastic streamflows in power generation planning problems.
Optim. Methods Softw., 2010


  Loading...