On convergence properties of a least-distance programming procedure for minimization problems under linear constraints

DOI10.1007/BF00939279zbMath0577.90069OpenAlexW2011087871MaRDI QIDQ1065717

B. George

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939279

zbMATH Keywords

convergence analysisglobal convergencequasiconvex functionslinear constraintspseudoconvex functionsleast-distance programming procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (3)

A Family of Supermemory Gradient Projection Methods for Constrained Optimization ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ Convergence of a projected gradient method variant for quasiconvex objectives

Cites Work

• Unnamed Item
• A least-distance programming procedure for minimization problems under linear constraints

This page was built for publication: On convergence properties of a least-distance programming procedure for minimization problems under linear constraints