construct_intermediate_chain,Problem,list-method

Builds a chain that rewrites a problem into an intermediate representation suitable for numeric reductions.

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

construct_intermediate_chain,Problem,list-method function

<dl><dt>problem</dt>
<dd>The problem for which to build a chain.</dd>
<dt>candidates</dt>
<dd>A list of candidate solvers.</dd>
<dt>gp</dt>
<dd>A logical value indicating whether the problem is a geometric program.</dd></dl>

Arguments

Builds a chain that rewrites a problem into an intermediate representation suitable for numeric reductions. — construct_intermediate_chain,Problem,list-method

<dl>

<dt>problem</dt>
<dd>The problem for which to build a chain.</dd>


<dt>candidates</dt>
<dd>A list of candidate solvers.</dd>


<dt>gp</dt>
<dd>A logical value indicating whether the problem is a geometric program.</dd>

</dl>

construct_intermediate_chain,Problem,list-method: Builds a chain that rewrites a problem into an intermediate representation suitable for numeric reductions.

Description

Usage

Value

Arguments