Add to ORKGIn this paper we describe a number of new variants of bundle methods for nonsmooth unconstrained and constrained convex optimization, convex—concave games and variational inequalities. We outline the ideas underlying these methods and present rate-of-convergence estimates
International audienceWe give a bundle method for constrained convex optimization. Instead of using ...
We study a class of generalized bundle methods where the stabilizing term can be any closed convex f...
We describe an extension of the redistributed technique form classical proximal bundle method to the...
Bundle methods are often the algorithms of choice for nonsmooth convex optimization, especially if a...
This chapter is devoted to algorithms for solving nonsmooth unconstrained difference of convex optim...
We discuss about the multiobjective double bundle method for nonsmooth multiobjective optimization w...
This is a summary of the author's PhD thesis supervised by Manlio Gaudioso and Maria Flavia Monaco a...
Abstract. We propose a bundle method for minimizing nonsmooth convex functions that combines both th...
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone l...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1992 ...
Copyright © by the paper's authors.A method from a class of bundle methods is proposed to solve an u...
The nonsmooth optimization methods can mainly be divided into two groups: subgradient and bundle met...
Bundle methods have been well studied in nonsmooth optimization. In most of the bundle methods devel...
© 2020, Springer Nature Switzerland AG. In the paper, a method is proposed for minimizing a nondiffe...
In this paper, we develop a version of the bundle method to solve unconstrained difference of convex...
International audienceWe give a bundle method for constrained convex optimization. Instead of using ...
We study a class of generalized bundle methods where the stabilizing term can be any closed convex f...
We describe an extension of the redistributed technique form classical proximal bundle method to the...
Bundle methods are often the algorithms of choice for nonsmooth convex optimization, especially if a...
This chapter is devoted to algorithms for solving nonsmooth unconstrained difference of convex optim...
We discuss about the multiobjective double bundle method for nonsmooth multiobjective optimization w...
This is a summary of the author's PhD thesis supervised by Manlio Gaudioso and Maria Flavia Monaco a...
Abstract. We propose a bundle method for minimizing nonsmooth convex functions that combines both th...
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone l...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1992 ...
Copyright © by the paper's authors.A method from a class of bundle methods is proposed to solve an u...
The nonsmooth optimization methods can mainly be divided into two groups: subgradient and bundle met...
Bundle methods have been well studied in nonsmooth optimization. In most of the bundle methods devel...
© 2020, Springer Nature Switzerland AG. In the paper, a method is proposed for minimizing a nondiffe...
In this paper, we develop a version of the bundle method to solve unconstrained difference of convex...
International audienceWe give a bundle method for constrained convex optimization. Instead of using ...
We study a class of generalized bundle methods where the stabilizing term can be any closed convex f...
We describe an extension of the redistributed technique form classical proximal bundle method to the...