Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities

New bundle methods for solving Lagrangian relaxation dual problems

Journal of Optimization Theory and Applications

A Boolean Penalty Method for Zero-One Nonlinear Programming

Journal of Global Optimization

Splitting-type method for systems of variational inequalities

Computers and Operations Research

Global Optimality Conditions for Discrete and Nonconvex OptimizationWith Applications to Lagrangian Heuristics and Column Generation

Operations Research

Non-smoothness in classification problems

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I

Splitting-type method for systems of variational inequalities

Computers and Operations Research

A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization

Computational Optimization and Applications

A descent proximal level bundle method for convex nondifferentiable optimization

Operations Research Letters

A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems

SIAM Journal on Optimization

Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization

Computational Optimization and Applications

A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs

Journal of Computational and Applied Mathematics

Implementing the simplex method as a cutting-plane method, with a view to regularization

Computational Optimization and Applications

Level bundle methods for constrained convex optimization with various oracles

Computational Optimization and Applications