Generalization of distance algorithm for constrainded optimization

MaRDI QIDQ2704966zbMATH OpenFDO

Authors Rui Xu, Kebang Zhang

Publication date 19 June 2001

Published in Journal of Shanghai Jiaotong University (Chinese Edition) (Search for Journal in Brave)

zbMATH Keywords

convex programmingdistance-algorithmmean value-level setnonlinear constrained global optimization

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Steepest descent methods with generalized distances for constrained optimization
• Newton-type Methods with Generalized Distances For Constrained Optimization
• A constrained interval approach to the generalized distance geometry problem
• A generalized like-distance in convex programming
• Feasible distance in non-conic convex optimization problems
• scientific article; zbMATH DE number 778132
• A Generalization of the Proximal Point Algorithm
• An Optimal Algorithm for Constrained Differentiable Convex Optimization
• scientific article; zbMATH DE number 4030852
• Generalized proximal point algorithm for convex optimization

Cited in

(3)

• A note on a maximum distance problem
• Steepest descent methods with generalized distances for constrained optimization
• Newton-type Methods with Generalized Distances For Constrained Optimization

This page was built for publication: Generalization of distance algorithm for constrainded optimization

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