A superlinear VU space-decomposition algorithm for semi-infinite constrained programming

MaRDI QIDQ2919909zbMATH OpenFDO

Authors Ming Huang, Li-Ping Pang, Yuan Lu, Zun-Quan Xia

Publication date 22 October 2012

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

Full work available at URL http://www.kcam.biz/contents/table_contents_view.php?idx=1354&Len

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Convex functions and convex programs in convex geometry (52A41) Semi-infinite programming (90C34)

Recommendations

• A superlinear space decomposition algorithm for constrained nonsmooth convex program
• An \({\mathcal{UV}}\)-algorithm for semi-infinite multiobjective programming
• An unconstrained convex programming approach to convex semi-infinite programming
• On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
• An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming

Cited in

(2)

• A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem
• A superlinear space decomposition algorithm for constrained nonsmooth convex program

This page was built for publication: A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming

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