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