Open AccessBook
Nondifferentiable Optimization
About:
The article was published on 1985-12-31 and is currently open access. It has received 419 citations till now.read more
Citations
More filters
Journal ArticleDOI
Soft set theory—First results
TL;DR: The main purpose of this paper is to introduce the basic notions of the theory of soft sets, to present the first results of the the theory, and to discuss some problems of the future.
Journal ArticleDOI
The Lagrangian Relaxation Method for Solving Integer Programming Problems
TL;DR: This paper is a review of Lagrangian relaxation based on what has been learned in the last decade and has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering.
Journal ArticleDOI
Incremental Subgradient Methods for Nondifferentiable Optimization
TL;DR: A number of variants of incremental subgradient methods for minimizing a convex function that consists of the sum of a large number of component functions are established, including some that are stochastic.
Journal ArticleDOI
Subgradient Methods for Saddle-Point Problems
Angelia Nedic,Asuman Ozdaglar +1 more
TL;DR: This work presents a subgradient algorithm for generating approximate saddle points and provides per-iteration convergence rate estimates on the constructed solutions, and focuses on Lagrangian duality, where it is shown this algorithm is particularly well-suited for problems where the subgradient of the dual function cannot be evaluated easily.
Journal ArticleDOI
Proximity control in bundle methods for convex
TL;DR: A technique is given for choosing {uk} adaptively that eliminates sensitivity to objective scaling and some encouraging numerical experience is reported.