Restricted simplicial decomposition: Computation and extensions

Donald W. Hearn, Siriphong Lawphongpanich, José A. Ventura

Type: Book-Chapter

Publication Date: 1987-01-01

Citations: 159

DOI: https://doi.org/10.1007/bfb0121181

View Publication

Locations

Mathematical programming studies - View

Similar Works

Action	Title	Year	Authors
+	Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems	1992	José A. Ventura Donald W. Hearn
+	Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows	1997	Torbjörn Larsson Michael Patriksson Clas Rydergren
+	Restricted simplicial decomposition for convex constrained problems	1993	José A. Ventura Donald W. Hearn
+	EXTENSIONS OF SIMPLICIAL DECOMPOSITION FOR SOLVING THE MULTICOMMODITY FLOW PROBLEM WITH BOUNDED ARC FLOWS AND CONVEX COSTS	1988	Daniel Stefek
+	Simplicial Decomposition for Convex Generalized Networks	1990	John M. Mulvey Stavros A. Zenios David P. Ahlfeld
+	SIMPLICIAL DECOMPOSITION WITH DISAGGREGATE REPRESENTATION: AN APPLICATION TO THE TRAFFIC ASSIGNMENT PROBLEM	1989	Torbjörn Larsson Michael Patriksson
+	Relaxations to Sparse Optimization Problems and Applications.	2017	Erik Skau
+	Simplicial decomposition in nonlinear programming algorithms	1977	Balder Von Hohenbalken
+	Simplicial Decomposition for Large Scale Quadratic Convex Programming	2017	Enrico Bettiol Lucas Létocart Francesco Rinaldi Emiliano Traversi
+	Applications to Discrete Problems	1999	Hanif D. Sherali Warren P. Adams
+	Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization	2001	Ricardo García‐Ródenas Ángel Marı́n Michael Patriksson
+ PDF Chat	A reformulation-linearization technique for optimization over simplices	2021	Aras Selvi Dick den Hertog Wolfram Wiesemann
+	Simplicial Branch-and-Reduce Algorithm for Convex Programs with a Multiplicative Constraint	2009	Harold P. Benson
+	Algorithms for Mixed-Integer Bilevel Problems with Convex Followers	2021	Thomas Kleinert
+	Preface: decomposition methods for hard optimization problems	2019	Fabio Furini Ivana Ljubić Emiliano Traversi
+	A simplicial decomposition framework for large scale convex quadratic programming	2017	Enrico Bettiol Lucas Létocart Francesco Rinaldi Emiliano Traversi
+	A simplicial decomposition framework for large scale convex quadratic programming	2017	Enrico Bettiol Lucas Létocart Francesco Rinaldi Emiliano Traversi
+	Solving large-scale nonlinear network problems with relaxation and decomposition algorithms	1993	José A. Ventura Chih-Hang John Wu
+	Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization	2004	Vishal Goyal
+	Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization	2004	Vishal Goyal Marianthi Ierapetritou

Works That Cite This (49)

Action	Title	Year	Authors
+	Restricted simplicial decomposition for convex constrained problems	1993	José A. Ventura Donald W. Hearn
+	Simultaneous structural analysis and design based on augmented Lagrangian duality	1995	Torbjörn Larsson Mikael Rönnqvist
+	Feasible Direction Methods for Constrained Nonlinear Optimization : Suggestions for Improvements	2007	Maria Mitradjieva-Daneva
+	Application of the dual active set algorithm to quadratic network optimization	1993	William W. Hager Donald W. Hearn
+	Computational development of a lagrangian dual approach for quadratic networks	1991	José A. Ventura
+ PDF Chat	A generic column generation principle: derivation and convergence analysis	2015	Torbjörn Larsson Athanasios Migdalas Michael Patriksson
+ PDF Chat	Conditional gradient algorithms for norm-regularized smooth convex optimization	2014	Zaïd Harchaoui Anatoli Juditsky Arkadi Nemirovski
+	Combination of trust region method and simplicial decomposition for convex constrained nonlinear optimization	2003	Guosheng Feng Zaiqin Cui
+	Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives	2018	Song Ping Zhou Swati Gupta Madeleine Udell
+	An augmented Lagrangian decomposition method for block diagonal linear programming problems	1989	Andrzej Ruszczyński

Works Cited by This (19)

Action	Title	Year	Authors
+	Applied Nonlinear Programming	1972	D. M. Himmelblau
+	A scaled reduced gradient algorithm for network flow problems with convex separable costs	1981	Ron S. Dembo John G. Klincewicz
+	An extension of the frank and Wolfe method of feasible directions	1974	Charles A. Holloway
+	User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming.	1983	Philip E. Gill Walter Murray Michael A. Saunders Margaret H. Wright
+	Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms	1977	Gordon H. Bradley Gerald G. Brown Glenn W. Graves
+	A finite algorithm to maximize certain pseudoconcave functions on polytopes	1975	Balder Von Hohenbalken
+	Simplicial decomposition in nonlinear programming algorithms	1977	Balder Von Hohenbalken
+	Critical Behavior of the Two-Dimensional Sticks System	1983	I. Balberg N. Binenbaum Charles H. Anderson
+ PDF Chat	A Reduced Gradient Algorithm for Nonlinear Network Problems	1983	Philip Beck Leon S. Lasdon Michael Engquist
+	Elements of Large-Scale Mathematical Programming Part I: Concepts	1970	Arthur M. Geoffrion