Pages that link to "Item:Q4005806"
From MaRDI portal
The following pages link to Decomposition and Nondifferentiable Optimization with the Projective Algorithm (Q4005806):
Displaying 50 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Column generation bounds for numerical microaggregation (Q486386) (← links)
- A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
- A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- New filled functions for nonsmooth global optimization (Q965609) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits (Q1291615) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- Time scale decomposition in production planning for unreliable flexible manufacturing systems (Q1388899) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- Robust min-max portfolio strategies for rival forecast and risk scenarios (Q1583147) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- A generalized projective reconstruction theorem and depth constraints for projective factorization (Q1800002) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- Scenario analysis via bundle decomposition (Q1896443) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- An oracle based method to compute a coupled equilibrium in a model of international climate policy (Q2271781) (← links)
