The Validity of a Family of Optimization Methods
From MaRDI portal
Publication:5589754
Cited in
(51)- Safe polyhedral tubes for locally convexified MPC
- A note on functions whose local minima are global
- On functions whose local minima are global
- Linear programs with an additional reverse convex constraint
- A systematic approach to the synthesis of algorithms
- A convergence theory for a class of anti-jamming strategies
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Variations and extension of the convex-concave procedure
- Generalized Benders decomposition
- Discussion on the convergence of Rosen's gradient projection method
- Remarks on the convergence of Rosen's gradient projection method
- On local search in d.c. optimization problems
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Paramétrisation et approximation d'un problème non convexe ; application à un problème de gestion de portefeuille
- Convex MPC for exclusion constraints
- Global convergence of Rosen's gradient projection method
- Reverse convex programming
- A nonisolated optimal solution for special reverse convex programming problems
- Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems
- On functions whose stationary points are global minima
- On the global minimization of a convex function under general nonconvex constraints
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- A level set algorithm for a class of reverse convex programs
- Optimization algorithms and point-to-set-maps
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- Partitioning procedure for polynomial optimization
- A review of the parameter estimation problem of fitting positive exponential sums to empirical data
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- Primal-relaxed dual global optimization approach
- A robust lot sizing problem with ill-known demands
- Implementation of gradient methods by tangential discretization
- Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
- Stability theorems for infinitely constrained mathematical programs
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- A convergence theorem of Rosen’s gradient projection method
- On the use of cuts in reverse convex programs
- scientific article; zbMATH DE number 7092133 (Why is no real title available?)
- The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
- Global convergence for Newton methods in mathematical programming
- Convex programs with an additional reverse convex constraint
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- Marginal values in mixed integer linear programming
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Convergence properties of local solutions of sequences of mathematical programming problems in general spaces
- Reverse convex problems: an approach based on optimality conditions
- Sensitivity analysis for nonlinear programming using penalty methods
- Global optimization for special reverse convex programming
- Solution of certain nonlinear programs involving r-convex functions
- Algorithm model for penalty functions-type iterative pcedures
- Applications of a general convergence theory for outer approximation algorithms
This page was built for publication: The Validity of a Family of Optimization Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589754)
