Paper · 1997

Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization

Ann‐Brith Strömberg

Chalmers Research (Chalmers University of Technology) · Published 1 January 1997

View at the publisherCite this paper

In brief

“Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization” is a 1997 paper by Ann‐Brith Strömberg, published in Chalmers Research (Chalmers University of Technology). OpenAlex counts 4 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
4
Most cited in
2015 (1)
Field-weighted impact
0.47
Authors
1

Abstract

The topic of the thesis is subgradient optimization methods in convex, nonsmooth optimization. These methods are frequently used, especially in the context of Lagrangean relaxation of large scale mathematical programs where they are remarkably often able to quickly identify near-optimal Lagrangean dual solutions. We present extensions of this class of methods, insights into their theoretical… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Strömberg, A. (1997). Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization. Chalmers Research (Chalmers University of Technology). https://research.chalmers.se/en/publication/142086

MLA 9

Strömberg, Ann‐Brith. “Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization.” Chalmers Research (Chalmers University of Technology), 1997. https://research.chalmers.se/en/publication/142086.

Chicago

Strömberg, Ann‐Brith. 1997. “Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization.” Chalmers Research (Chalmers University of Technology). https://research.chalmers.se/en/publication/142086.

Harvard

Strömberg, A. (1997) ‘Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization’, Chalmers Research (Chalmers University of Technology). Available at: https://research.chalmers.se/en/publication/142086.

IEEE

A. Strömberg, “Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization,” Chalmers Research (Chalmers University of Technology), 1997.

BibTeX

@article{stromberg1997conditional,
  title     = {{Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization}},
  author    = {Strömberg, Ann‐Brith},
  journal   = {Chalmers Research (Chalmers University of Technology)},
  year      = {1997},
  url       = {https://research.chalmers.se/en/publication/142086}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • ergodic convergence
  • nonsmooth optimization
  • convex optimization
  • Lagrangian relaxation
  • active constraint identification
  • optimality conditions
  • simplicial decomposition
  • termination criteria

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Strömberg, A. (1997). Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization. Chalmers Research (Chalmers University of Technology). https://research.chalmers.se/en/publication/142086

How many times has this paper been cited?

4 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Ann‐Brith Strömberg.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.