Publication | Date of Publication | Type |
---|
Computing critical angles between two convex cones | 2023-09-29 | Paper |
Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems | 2023-07-12 | Paper |
Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ | 2022-12-20 | Paper |
Revisiting augmented Lagrangian duals | 2022-11-14 | Paper |
S-BORM: Reliability-based optimization of general systems using buffered optimization and reliability method | 2022-09-06 | Paper |
Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers | 2022-05-11 | Paper |
A derivative-free trust-region algorithm with copula-based models for probability maximization problems | 2022-02-22 | Paper |
Risk-averse stochastic programming and distributionally robust optimization via operator splitting | 2022-01-24 | Paper |
A bundle method for nonsmooth DC programming with application to chance-constrained problems | 2021-06-01 | Paper |
The ABC of DC programming | 2021-05-06 | Paper |
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem | 2021-05-03 | Paper |
Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse | 2020-11-09 | Paper |
Asynchronous level bundle methods | 2020-10-21 | Paper |
Sequential difference-of-convex programming | 2020-09-10 | Paper |
Some brief observations in minimizing the sum of locally Lipschitzian functions | 2020-04-27 | Paper |
An inertial algorithm for DC programming | 2019-12-19 | Paper |
Proximal bundle methods for nonsmooth DC programming | 2019-10-01 | Paper |
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems | 2019-09-04 | Paper |
Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions | 2019-08-02 | Paper |
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies | 2019-06-12 | Paper |
Target radius methods for nonsmooth convex optimization | 2019-02-22 | Paper |
Probabilistic optimization via approximate \(p\)-efficient points and bundle methods | 2018-07-11 | Paper |
Outer-approximation algorithms for nonsmooth convex MINLP problems | 2018-06-05 | Paper |
Uncontrolled inexact information within bundle methods | 2017-05-23 | Paper |
Regularized optimization methods for convex MINLP problems | 2017-03-28 | Paper |
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support | 2016-12-15 | Paper |
Convexity and optimization with copulæ structured probabilistic constraints | 2016-08-29 | Paper |
On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces | 2016-05-13 | Paper |
A doubly stabilized bundle method for nonsmooth convex optimization | 2016-04-04 | Paper |
A strongly convergent proximal bundle method for convex minimization in Hilbert spaces | 2016-03-08 | Paper |
Convex proximal bundle methods in depth: a unified analysis for inexact oracles | 2014-12-18 | Paper |
Level bundle methods for oracles with on-demand accuracy | 2014-10-29 | Paper |
Level bundle-like algorithms for convex optimization | 2014-10-02 | Paper |
Level bundle methods for constrained convex optimization with various oracles | 2014-09-04 | Paper |
Optimal scenario tree reduction for stochastic streamflows in power generation planning problems | 2010-10-12 | Paper |
Computing critical angles between two convex cones | 0001-01-03 | Paper |