The following pages link to Welington de Oliveira (Q263187):
Displayed 37 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Item:Q263187 (redirect page) (← links)
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- Item:Q263187 (redirect page) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- The ABC of DC programming (Q829493) (← links)
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
- Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting (Q2070402) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers (Q2138295) (← links)
- Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- An inertial algorithm for DC programming (Q2281267) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces (Q2805982) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
- Optimal scenario tree reduction for stochastic streamflows in power generation planning problems (Q3161151) (← links)
- Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ (Q5058412) (← links)
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5131710) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems (Q6114895) (← links)
- S-BORM: Reliability-based optimization of general systems using buffered optimization and reliability method (Q6409857) (← links)
- Computing critical angles between two convex cones (Q6453188) (← links)