A new algorithm for solving the non-differentiable convex feasibility problem

MaRDI QIDQ3131039zbMATH OpenFDO

Authors Xuting Wang, Jinling Zhao

Publication date 29 January 2018

zbMATH Keywords

descent directiondirectional derivativemaximum functionnon-differentiable convex feasibility problem

Mathematics Subject Classification ID

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

Recommendations

• A non-interior continuation algorithm for solving the convex feasibility problem
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• scientific article; zbMATH DE number 6263278
• Algorithms for the quasiconvex feasibility problem
• On an algorithm in nondifferential convex optimization

Cited in

(3)

• A non-interior continuation algorithm for solving the convex feasibility problem
• scientific article; zbMATH DE number 6263278 (Why is no real title available?)
• A new heuristic approach for non-convex optimization problems

This page was built for publication: A new algorithm for solving the non-differentiable convex feasibility problem

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