Problem-arith

+,Problem,missing-method

-,Problem,missing-method

+,Problem,numeric-method

+,numeric,Problem-method

+,Problem,Problem-method

-,Problem,numeric-method

-,numeric,Problem-method

-,Problem,Problem-method

*,Problem,numeric-method

*,numeric,Problem-method

/,Problem,numeric-method

Add, subtract, multiply, or divide DCP optimization problems.

An object-oriented modeling language for disciplined
convex programming (DCP) as described in Fu, Narasimhan, and Boyd
(2020, <doi:10.18637/jss.v094.i14>). It allows the user to
formulate convex optimization problems in a natural way following
mathematical convention and DCP rules. The system analyzes the
problem, verifies its convexity, converts it into a canonical
form, and hands it off to an appropriate solver to obtain the
solution. Interfaces to solvers on CRAN and elsewhere are
provided, both commercial and open source.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

David W Kang

Steven Diamond

John Miller

Stephen Boyd

Paul Kunsberg Rosenfield

Problem-arith function

<dl><dt>e1</dt>
<dd>The left-hand Problem object.</dd>
<dt>e2</dt>
<dd>The right-hand Problem object.</dd></dl>

Arguments

Arithmetic Operations on Problems — Problem-arith

<dl>

<dt>e1</dt>
<dd>The left-hand Problem object.</dd>


<dt>e2</dt>
<dd>The right-hand Problem object.</dd>

</dl>

Arithmetic Operations on Problems

Problem-arith: Arithmetic Operations on Problems

Description

Usage

Value

Arguments