Pith. sign in

REVIEW

Generalized Polyhedral Convex Optimization Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1709.10227 v1 pith:32QCFCEX submitted 2017-09-29 math.OC

Generalized Polyhedral Convex Optimization Problems

classification math.OC
keywords convexconditionsdualitygeneralizedoptimizationpolyhedralproblemproblems
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We establish solution existence theorems, necessary and sufficient optimality conditions, weak and strong duality theorems. In particular, we show that the dual problem has the same structure as the primal problem, and the strong duality relation holds under three different sets of conditions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.