Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,490,761 papers from all fields of science
Search
Sign In
Create Free Account
Subgradient method
Known as:
Bundle method
, Nonsmooth minimization
, Subgradient methods
Subgradient methods are iterative methods for solving convex minimization problems. Originally developed by Naum Z. Shor and others in the 1960s and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Convex function
Convex optimization
Convex set
Drift plus penalty
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Multiobjective double bundle method for nonsmooth constrained multiobjec-tive DC optimization
O. Montonen
2017
Corpus ID: 51997106
The multiobjective DC optimization problems arise naturally, for example, in data classification and cluster analysis playing a…
Expand
2014
2014
Toward a scalable chance-constrained formulation for unit commitment to manage high penetration of variable generation
G. Martinez
,
L. Anderson
Allerton Conference on Communication, Control…
2014
Corpus ID: 9690062
In this work, a risk-averse optimization model is applied to the security constrained unit commitment problem. The optimal day…
Expand
2011
2011
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem
S. Hanafi
,
C. Sterle
,
A. Ushakov
,
I. Vasilyev
Stud. Inform. Univ.
2011
Corpus ID: 5595204
In this paper we address a parallel version of subgradient algorithm to maximize Lagrangean dual function for the p-median…
Expand
2008
2008
Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks
E. Guney
,
I. K. Altmel
,
N. Aras
,
Cem Ersoy
International Symposium on Computer and…
2008
Corpus ID: 17315590
In this work we consider routing and sink location problems in sensor networks and propose two new mixed integer programming…
Expand
2008
2008
Limited Memory Bundle Method for Large Bound Constrained Nonsmooth Optimization
Napsu Karmitsa
2008
Corpus ID: 15961998
1. Abstract Practical optimization problems often involve nonsmooth functions of hundreds or thousands of variables. As a rule…
Expand
Highly Cited
2004
Highly Cited
2004
Dual optimization methods for multiuser orthogonal frequency division multiplex systems
Wei Yu
,
R. Lui
,
R. Cendrillon
IEEE Global Telecommunications Conference…
2004
Corpus ID: 9633490
The design and optimization of orthogonal frequency division multiplex (OFDM) systems typically take the following form. The…
Expand
2004
2004
Nonsmooth training of fuzzy neural networks
Christian Eitzinger
Soft Computing - A Fusion of Foundations…
2004
Corpus ID: 22349134
The integration of fuzzy methods and neural networks often leads to nonsmoothness of the neural network and, consequently, to a…
Expand
2000
2000
SBmethod - A C++ Implementation of the Spectral Bundle Method: Manual to Version 1.1
C. Helmberg
2000
Corpus ID: 116643131
1993
1993
Stability of structures with nonsmooth nonconvex energy functionals. The one dimensional case
M. Kurutz
1993
Corpus ID: 116688950
This paper introduces the stability analysis of simple one dimensional structures whose strain energy functionals are nonsmooth…
Expand
1983
1983
A new characterization of Clarke's tangent cone and its applications to subgradient analysis and optimization
J. S. Treiman
1983
Corpus ID: 118246437