Simplicial decomposition in nonlinear programming algorithms

DOI10.1007/BF01584323zbMath0362.90086OpenAlexW2005477778MaRDI QIDQ4136951

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584323

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (48)

Lagrangean relaxation. (With comments and rejoinder). ⋮ Finite method for a nonlinear allocation problem ⋮ Single-projection procedure for linear optimization ⋮ A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ ⋮ Dynamic traffic assignment: Considerations on some deterministic modelling approaches ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ A survey of some mathematical programming models in transportation ⋮ A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network ⋮ Screening for a reweighted penalized conditional gradient method ⋮ Modelling the number and location of sidings on a single line railway ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ A combinatorial approximation algorithm for supply chain network flow problem ⋮ A smooth penalty function algorithm for network-structured problems ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ First-order methods for convex optimization ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Stochastic network optimization models for investment planning ⋮ Analysis of relaxations for the multi-item capacitated lot-sizing problem ⋮ Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints ⋮ D-optimal design of a monitoring network for parameter estimation of distributed systems ⋮ A finite algorithm to maximize certain pseudoconcave functions on polytopes ⋮ Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ A partial linearization method for the traffic assignment problem ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints ⋮ An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems ⋮ Equivalence of some quadratic programming algorithms ⋮ A decomposition algorithm for quadratic programming ⋮ A scenario-based stochastic programming approach for technology and capacity planning ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ An equivalence between two algorithms for quadratic programming ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ Conditional subgradient optimization -- theory and applications ⋮ Least distance methods for the scheme of polytopes ⋮ Combination of trust region method and simplicial decomposition for convex constrained nonlinear optimization ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ Sensor network scheduling for identification of spatially distributed processes ⋮ On the Effectiveness of Richardson Extrapolation in Data Science ⋮ Finiteness in restricted simplicial decomposition ⋮ On the rate of convergence of two minimax algorithms ⋮ A unified description of iterative algorithms for traffic equilibria

Cites Work

This page was built for publication: Simplicial decomposition in nonlinear programming algorithms