scientific article; zbMATH DE number 6135095

MaRDI QIDQ4906154zbMATH OpenFDO

Authors Ching-Feng Wen

Publication date 7 February 2013

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A continuous method for convex programming problems
• scientific article; zbMATH DE number 4025174
• Approximate solutions and error bounds for a class of continuous-time linear programming problems
• scientific article; zbMATH DE number 1488907
• scientific article; zbMATH DE number 3896671
• An approximate method for solving the convex programming problem
• scientific article; zbMATH DE number 3847229
• scientific article; zbMATH DE number 522746
• Convexification approaches for a class of continuous global optimization problem
• scientific article; zbMATH DE number 1267004

Cited in

(5)

• 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
• Continuous-time quadratic programming problems: approximate solutions and error estimation
• Approximate solutions and error bounds for a class of continuous-time linear programming problems
• Discrete approximation of a problem of continuous programming

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)