A finite algorithm to maximize certain pseudoconcave functions on polytopes
From MaRDI portal
Publication:4086973
DOI10.1007/BF01681343zbMath0323.90042OpenAlexW2005069425MaRDI QIDQ4086973
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01681343
Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)
Related Items (25)
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ A note on a globally convergent Newton method for solving monotone variational inequalities ⋮ Maximizing pseudoconvex transportation problem: A special type ⋮ Least distance methods for the frame of homogeneous equation systems ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ Minimizing pseudoconvex functions on convex compact sets ⋮ A generalized conjugate gradient algorithm for minimization ⋮ Variable metric method for unconstrained multiobjective optimization problems ⋮ Minimization of a convex functional in a linear system of delay differential equations with fixed ends ⋮ A partial linearization method for the traffic assignment problem ⋮ Finding the nearest point in A polytope ⋮ A numerical method to minimize resource consumption by linear systems with constant delay ⋮ Simplicial decomposition in nonlinear programming algorithms ⋮ Equivalence of some quadratic programming algorithms ⋮ Imperfect conjugate gradient algorithms for extended quadratic functions ⋮ A decomposition algorithm for quadratic programming ⋮ An equivalence between two algorithms for quadratic programming ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ Least distance methods for the scheme of polytopes ⋮ A multifactor model for international plant location and financing under uncertainty ⋮ An augmented Lagrangian decomposition method for block diagonal linear programming problems ⋮ Method to determine an optimal control in the minimum of resource consumption for the nonlinear stationary systems ⋮ Epsilon-dominating solutions in mean-variance portfolio analysis ⋮ Convergence of a subgradient method for computing the bound norm of matrices ⋮ Finiteness in restricted simplicial decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition Principle for Linear Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Simplicial decomposition in nonlinear programming algorithms
- Efficient and optimal portfolios by homogeneous programming
- Convex Analysis
- Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs
This page was built for publication: A finite algorithm to maximize certain pseudoconcave functions on polytopes
