Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 203

The DOI matches its Crossref record.

Penalty/Barrier Multiplier Methods for Convex Programming Problems

Ben-Tal, Aharon, Zibulevsky, Michael · 1997 · SIAM Journal on Optimization

Abstract

We study a class of methods for solving convex programs, which are based on nonquadratic augmented Lagrangians for which the penalty parameters are functions of the multipliers. This gives rise to Lagrangians which are nonlinear in the multipliers. Each augmented Lagrangian is specified by a choice of a penalty function $\varphi$ and a penalty-updating function $\pi$. The requirements on $\varphi$ are mild and allow for the inclusion of most of the previously suggested augmented Lagrangians. More importantly, a new type of penalty/barrier function (having a logarithmic branch glued to a quadratic branch) is introduced and used to construct an efficient algorithm. Convergence of the algorithms is proved for the case of $\pi$ being a sublinear function of the dual multipliers. The algorithms are tested on large-scale quadratically constrained problems arising in structural optimization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s1052623493259215

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 203

Metadata

Authors
Ben-Tal, A., & Zibulevsky, M.
Venue
SIAM Journal on Optimization
Published
1997-05
Volume
7
Issue
2
Pages
347-366
ISSN
  • 1052-6234 (ISSN-L)
  • 1095-7189
OpenAlex
W2001473319
Cited by
203
References
0
FWCI
6.99
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Penalty/Barrier Multiplier Methods for Convex Programming Problems. https://app.cochat.ai/papers/10.1137/s1052623493259215
The paper
Ben-Tal, A., & Zibulevsky, M. (1997). Penalty/Barrier Multiplier Methods for Convex Programming Problems. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623493259215

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.