A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization

MaRDI QIDQ2915929zbMATH OpenFDO

Authors Jinbao Jian, Chunming Tang

Publication date 5 October 2012

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

global convergencenonsmooth optimizationstrongly sub-feasible direction methodsubgradient selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
• A subgradient method for unconstrained nonconvex nonsmooth optimization
• scientific article; zbMATH DE number 4147420
• scientific article; zbMATH DE number 1437399
• A strongly convergent method of quasi-strongly sub-feasible directions for constrained optimization

Cited in

(4)

• A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
• scientific article; zbMATH DE number 1437399 (Why is no real title available?)
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments

This page was built for publication: A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization

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