The following pages link to The Convex Simplex Method (Q5532893):
Displaying 28 items.
- Sur la convergence théorique de la méthode du gradient reduit généralise (Q599484) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- Simplex-inspired algorithms for solving a class of convex programming problems (Q941039) (← links)
- A unified approach to the feasible direction methods for nonlinear programming with linear constraints (Q1058461) (← links)
- A forward convex-simplex method (Q1089264) (← links)
- Piecewise linear optimization (Q1143319) (← links)
- Geometric programming. Method and applications (Q1147073) (← links)
- Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato (Q1148802) (← links)
- An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
- Computer experiments on quadratic programming algorithms (Q1154392) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- Decomposition of the convex simplex method (Q1211410) (← links)
- Generalized reduced gradient method as an extension of feasible direction methods (Q1230358) (← links)
- A modified reduced gradient method for dual posynomial programming (Q1243245) (← links)
- A comparison of computational strategies for geometric programs (Q1243253) (← links)
- On a stochastic program with simple recourse (Q1247920) (← links)
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
- A feasible descent cone method for linearly constrained minimization problems (Q1336880) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties (Q1813345) (← links)
- A modified convace simplex algorithm for geometric programming (Q2265341) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- An algorithm for nonlinear programs over Cartesian product sets (Q3348713) (← links)
- (Q3487119) (← links)
- A modified reduced gradient method for a class of nondifferentiable problems (Q3902833) (← links)
- Linear max-min programming (Q3905079) (← links)
- Sur quelques méthodes de gradient réduit sous contraintes linéaires (Q4197638) (← links)
