Barrier method for convex optimization problem without regularity of constraint functions

MaRDI QIDQ5147187zbMATH OpenFDO

Authors Porntip Promsinchai, Narin Petrot

Publication date 2 February 2021

Full work available at URL http://yokohamapublishers.jp/online-p/LNA/vol4/lnav4n1p9.pdf

zbMATH Keywords

barrier functionClarke derivativeconvex optimizationdirectionally differentiablelocally Lipschitz functionregular function

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Numerical optimization and variational techniques (65K10)

Recommendations

• Barrier method in nonsmooth convex optimization without convex representation
• On convex optimization without convex representation
• A barrier method in convex vector optimization with generalized inequality constraints
• scientific article; zbMATH DE number 14495
• Optimality conditions and a barrier method in optimization with convex geometric constraint

Cited in

(2)

• A barrier method in convex vector optimization with generalized inequality constraints
• Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems

This page was built for publication: Barrier method for convex optimization problem without regularity of constraint functions

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