↓ Skip to main content
What is this page? Embed badge

Nondifferentiable Optimization and Polynomial Problems

Overview of attention for book
Cover of 'Nondifferentiable Optimization and Polynomial Problems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Elements of Convex Analysis, Linear Algebra, and Graph Theory
  3. Altmetric Badge
    Chapter 2 Subgradient and ε -Subgradient Methods
  4. Altmetric Badge
    Chapter 3 Subgradient-Type Methods with Space Dilation
  5. Altmetric Badge
    Chapter 4 Elements of Information and Numerical Complexity of Polynomial Extremal Problems
  6. Altmetric Badge
    Chapter 5 Decomposition Methods Based on Nonsmooth Optimization
  7. Altmetric Badge
    Chapter 6 Algorithms for Constructing Optimal on Volume Ellipsoids and Semidefinite Programming
  8. Altmetric Badge
    Chapter 7 The Role of Ellipsoid Method for Complexity Analysis of Combinatorial Problems
  9. Altmetric Badge
    Chapter 8 Semidefinite Programming Bounds for Extremal Graph Problems
  10. Altmetric Badge
    Chapter 9 Global Minimization of Polynomial Functions and 17-th Hilbert Problem
Attention for Chapter 2: Subgradient and ε -Subgradient Methods
Altmetric Badge

Citations

dimensions_citation
184 Dimensions
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Subgradient and ε -Subgradient Methods
Chapter number 2
Book title
Nondifferentiable Optimization and Polynomial Problems
Published by
Springer, Boston, MA, January 1998
DOI 10.1007/978-1-4757-6015-6_2
Book ISBNs
978-1-4419-4792-5, 978-1-4757-6015-6
Authors

Naum Z. Shor, Shor, Naum Z.

View on publisher site

This page is provided by Altmetric.