Pages that link to "Item:Q4136951"
From MaRDI portal
The following pages link to Simplicial decomposition in nonlinear programming algorithms (Q4136951):
Displaying 49 items.
- Single-projection procedure for linear optimization (Q330507) (← links)
- Column generation algorithms for nonlinear optimization. II: Numerical investigations (Q609805) (← links)
- A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
- Stochastic network optimization models for investment planning (Q917418) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Finiteness in restricted simplicial decomposition (Q1069859) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- A survey of some mathematical programming models in transportation (Q1367685) (← links)
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872) (← links)
- Modelling the number and location of sidings on a single line railway (Q1373880) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (Q1824569) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Finite method for a nonlinear allocation problem (Q1896578) (← links)
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches (Q1908277) (← links)
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints (Q1970426) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management (Q2184057) (← links)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- Sensor network scheduling for identification of spatially distributed processes (Q2861914) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- A partial linearization method for the traffic assignment problem (Q3835623) (← links)
- A decomposition algorithm for quadratic programming (Q3870676) (← links)
- An equivalence between two algorithms for quadratic programming (Q3895232) (← links)
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems (Q4000924) (← links)
- A finite algorithm to maximize certain pseudoconcave functions on polytopes (Q4086973) (← links)
- Least distance methods for the scheme of polytopes (Q4192906) (← links)
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
- Combination of trust region method and simplicial decomposition for convex constrained nonlinear optimization (Q4467173) (← links)
- Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming (Q4641662) (← links)
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
- Simplicial Decomposition for Convex Generalized Networks (Q4712275) (← links)
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ (Q4819970) (← links)
- An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems (Q4928946) (← links)
- On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
- A scenario-based stochastic programming approach for technology and capacity planning (Q5959372) (← links)
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods (Q6126647) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
- PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
