Minimizing pseudoconvex functions on convex compact sets
An algorithm is presented which minimizes continuously differentiable pseudo-convex functions on convex compact sets which are characterized by their support functions. If the function can be minimized exactly on affine sets in a finite number of operations and the constraints set is a polytope, the algorithm has finite convergence. Numerical results are reported which illustrate the performance of the algorithm when applied to a specific search direction problem. The algorithm differs from existing algorithms in that it has proven convergence when applied to any convex compact set, and not just polytopal sets.
- An algorithm for constrained convex optimization
- On an approach to the construction of algorithms for the unconditional minimization of pseudoconvex functions
- scientific article; zbMATH DE number 3993310
- The relaxation method for certain type of pseudoconvex programming problems
- Relaxation algorithms for constrained minimization of nonsmooth strictly pseudoconvex functions
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Convex Analysis
- Finding the nearest point in A polytope
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- On the design of linear multivariable feedback systems via constrained nondifferentiable optimization in H/sup infinity / spaces
- On the rate of convergence of certain methods of centers
- On an approach to the construction of algorithms for the unconditional minimization of pseudoconvex functions
- Stability of algorithms of unconditional minimization of pseudoconvex functions
- Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- Maximizing pseudoconvex transportation problem: A special type
- Algorithms for optimal design with application to multiple polynomial regression
- Computing optimal approximate invariant designs for cubic regression on multidimensional balls and cubes
- An algorithm for constrained convex optimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- On a class of algorithms from experimental design theory
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Minimisation de fonctionnelles dans un ensemble de fonctions convexes
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Second order methods for solving extremum problems form optimal linar regression design
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- Minimization of a convex functional on a class of sets in a measure space
This page was built for publication: Minimizing pseudoconvex functions on convex compact sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120481)
