Interior-point algorithms for LO and SDO based on a new class of kernel functions

MaRDI QIDQ4906166zbMATH OpenFDO

Authors You-Young Cho, Gyeong-Mi Cho

Publication date 7 February 2013

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

zbMATH Keywords

polynomial complexitysemidefinite optimizationlinear optimizationprimal-dual methodinterior-point methodsmall- and large-update method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Semidefinite programming (90C22)

Recommendations

• New parameterized kernel functions for linear optimization
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions

Cited in

(1)

• A new full-Newton step infeasible interior-point method for linear optimization

This page was built for publication: Interior-point algorithms for LO and SDO based on a new class of kernel functions

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