A maximization method for a class of quasiconcave programs

DOI10.1007/BF00934338MaRDI QIDQ1148799zbMATH OpenFDO

Authors P. M. Ellner

Publication date 1982

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

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

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

• scientific article; zbMATH DE number 3475251 (Why is no real title available?)
• scientific article; zbMATH DE number 3557508 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3296898 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3400681 (Why is no real title available?)
• A central cutting plane algorithm for the convex programming problem
• An Algorithm for Constrained Optimization with Semismooth Functions
• Convex Analysis
• Generalized Gradients and Applications
• Newton's method for convex programming and Tschebyscheff approximation
• Quasi-Concave Programming
• Semismooth and Semiconvex Functions in Constrained Optimization
• The Cutting-Plane Method for Solving Convex Programs
• The Supporting Hyperplane Method for Unimodal Programming

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

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