Simplicial decomposition in nonlinear programming algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3249567 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- A Rapidly Convergent Descent Method for Minimization
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- An extension of the frank and Wolfe method of feasible directions
- Convex Analysis
- Decomposition Principle for Linear Programs
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Finding the nearest point in A polytope
- Function minimization by conjugate gradients
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- Quasi-Concave Programming
- Some Algorithms for Minimizing a Function of Several Variables
- Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Cited in
(50)- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
- 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
- A scenario-based stochastic programming approach for technology and capacity planning
- A unified description of iterative algorithms for traffic equilibria
- A partial linearization method for the traffic assignment problem
- Fair integer programming under dichotomous and cardinal preferences
- First-order methods for convex optimization
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- On the rate of convergence of two minimax algorithms
- An equivalence between two algorithms for quadratic programming
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
- Stochastic network optimization models for investment planning
- Combination of trust region method and simplicial decomposition for convex constrained nonlinear optimization
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- Finite method for a nonlinear allocation problem
- A smooth penalty function algorithm for network-structured problems
- A decomposition algorithm for quadratic programming
- Conditional subgradient optimization -- theory and applications
- Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management
- A survey of some mathematical programming models in transportation
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- An oracle-based framework for robust combinatorial optimization
- A combinatorial approximation algorithm for supply chain network flow problem
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Single-projection procedure for linear optimization
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- PolyCD: optimization via cycling through the vertices of a polytope
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
- Screening for a reweighted penalized conditional gradient method
- Column generation algorithms for nonlinear optimization. II: Numerical investigations
- Lagrangean relaxation. (With comments and rejoinder).
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches
- Least distance methods for the scheme of polytopes
- Finiteness in restricted simplicial decomposition
- Sensor network scheduling for identification of spatially distributed processes
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Simplicial Decomposition for Convex Generalized Networks
- On the effectiveness of Richardson extrapolation in data science
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Equivalence of some quadratic programming algorithms
- Modelling the number and location of sidings on a single line railway
This page was built for publication: Simplicial decomposition in nonlinear programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136951)
