A maximization method for a class of quasiconcave programs

DOI10.1007/BF00934338zbMath0452.90056MaRDI QIDQ1148799

P. M. Ellner

Publication date: 1982

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

zbMATH Keywords

constrained optimizationnonsmooth programmingbounded feasible regionconstraint dropping devisecontinuous quasiconcave problem functionslinearized method of centersmaximization methodquasiconcave programs

Mathematics Subject Classification ID

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

Cites Work

• Newton's method for convex programming and Tschebyscheff approximation
• The Cutting-Plane Method for Solving Convex Programs
• Quasi-Concave Programming
• Generalized Gradients and Applications
• A central cutting plane algorithm for the convex programming problem
• Semismooth and Semiconvex Functions in Constrained Optimization
• An Algorithm for Constrained Optimization with Semismooth Functions
• The Supporting Hyperplane Method for Unimodal Programming
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A maximization method for a class of quasiconcave programs