scientific article; zbMATH DE number 6135095

zbMATH Open1274.90269MaRDI QIDQ4906154

Ching-Feng Wen

Publication date: 7 February 2013

Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol13/p397.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

DualityApproximation solutionsContinuous-time convex programming problemsContinuous-time linear programming problemsDiscretization problems

Mathematics Subject Classification ID

Could not fetch data.

Related Items (2)

A fast continuous time approach with time scaling for nonsmooth convex optimization ⋮ On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall

Recommendations

• An approximate method for solving the convex programming problem 👍 👎
• A continuous method for convex programming problems 👍 👎
• Approximate solutions and error bounds for a class of continuous-time linear programming problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906154)