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

The left-hand <a href="/link/?package=CVXR&version=1.0" problem'="" data-mini-rdoc="CVXR::"></a>'>Problem object.

The right-hand <a href="/link/?package=CVXR&version=1.0" problem'="" data-mini-rdoc="CVXR::"></a>'>Problem object.

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

An object-oriented modeling language for disciplined convex
programming (DCP). 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.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

David W Kang

Steven Diamond

John Miller

Stephen Boyd

Paul Kunsberg Rosenfield

Problem-arith function

The left-hand <a href='<a href='Problem'></a>'>Problem</a> object.

The right-hand <a href='<a href='Problem'></a>'>Problem</a> object.

Arithmetic Operations on Problems — Problem-arith

Arithmetic Operations on Problems

Problem-arith: Arithmetic Operations on Problems

Description

Usage

Arguments

Value