20114ORRequires access

The minimal cone for conic linear programming

Qinghong Zhang

Open publisher page 2 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Conic section, Cone (formal languages), Duality (order theory), Second-order cone programming, Dual cone and polar cone, Semidefinite programming, Conic optimization, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
The minimal cone for conic linear programming — Research Paper | ScholarLens