A finite algorithm to maximize certain pseudoconcave functions on polytopes

DOI10.1007/BF01681343MaRDI QIDQ4086973zbMATH OpenOpenAlexFDO

Authors Balder von Hohenbalken

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx) Nonlinear programming (90C30)

Cites work

• Convex Analysis
• Decomposition Principle for Linear Programs
• Efficient and optimal portfolios by homogeneous programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3284927 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• Simplicial decomposition in nonlinear programming algorithms
• Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(25)

• Method to determine an optimal control in the minimum of resource consumption for the nonlinear stationary systems
• Convergence of a subgradient method for computing the bound norm of matrices
• Finiteness in restricted simplicial decomposition
• A note on a globally convergent Newton method for solving monotone variational inequalities
• Least distance methods for the frame of homogeneous equation systems
• Minimizing pseudoconvex functions on convex compact sets
• A generalized conjugate gradient algorithm for minimization
• Epsilon-dominating solutions in mean-variance portfolio analysis
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
• A multifactor model for international plant location and financing under uncertainty
• Maximizing pseudoconvex transportation problem: A special type
• A numerical method to minimize resource consumption by linear systems with constant delay
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Equivalence of some quadratic programming algorithms
• A partial linearization method for the traffic assignment problem
• A decomposition algorithm for quadratic programming
• An equivalence between two algorithms for quadratic programming
• A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
• Finding the nearest point in A polytope
• Simplicial decomposition in nonlinear programming algorithms
• Least distance methods for the scheme of polytopes
• Simplicial Decomposition for Convex Generalized Networks
• Minimization of a convex functional in a linear system of delay differential equations with fixed ends
• Imperfect conjugate gradient algorithms for extended quadratic functions
• Variable metric method for unconstrained multiobjective optimization problems

This page was built for publication: A finite algorithm to maximize certain pseudoconcave functions on polytopes

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