CoChat

Disciplined convex-concave programming

Open access
Shen, Xinyue, Diamond, Steven, Gu, Yuantao, Boyd, Stephen · 2016 · 2016 IEEE 55th Conference on Decision and Control (CDC)
Cited by 136

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP). Convex-concave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions that are a sum of a convex and a concave term. DCP is a structured way to define convex optimization problems, based on a family of basic convex and concave functions and a few rules for combining them. Problems expressed using DCP can be automatically converted to standard form and solved by a generic solver; widely used implementations include YALMIP, CVX, CVXPY, and Convex. jl. In this paper we propose a framework that combines the two ideas, and includes two improvements over previously published work on convex-concave programming, specifically the handling of domains of the functions, and the issue of subdifferentiability on the boundary of the domains. We describe a Python implementation called DCCP, which extends CVXPY, and give examples.

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.1109/cdc.2016.7798400

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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

Cites

  • An Introduction To Compressive Sampling

    Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017 · cited 1×

    “Sparse recovery using `1/2 ‘norm’ The aim is to recover a sparse nonnegative signal x0 ∈ R from a measurement vector y = Ax0, where A ∈ Rm×n (with m < n) is a known sensing matrix [40].”
    Method
  • The Concave-Convex Procedure

    Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151 · cited 1×

    “The convex-concave procedure (CCP) [22], [23] is another heuristic algorithm for finding a local optimum of (1), which leverages our ability to efficiently solve convex optimization problems.”
    Background
  • Disciplined Convex Programming

    Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026 · cited 1×

    “convexication step fails. This is one of the issues we will address in this paper. 1.2 Disciplined convex programming Disciplined convex programming (DCP) is a methodology introduced by Grant et al. [GBY06] that imposes a set of conventions that must be followed when constructing (or specifying or dening) convex progr…”
    MethodInfluentialSelf-citation
  • Variations and extension of the convex–concave procedure

    Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744 · cited 3×

    “The method we present in this paper is an extension of the penalty CCP method introduced in [30], given as algorithm I.”
    BackgroundMethodInfluentialSelf-citation

Cited by

See all 136

Metadata

Authors
Shen, X., Diamond, S., Gu, Y., & Boyd, S.
Venue
2016 IEEE 55th Conference on Decision and Control (CDC)
Publisher
IEEE
Published
2016-12
Pages
1009-1014
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2963718773
Cited by
136
References
4
FWCI
14.29
Type
conference paper
Language
en
Open access
green

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

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.