Validation of subgradient optimization
From MaRDI portal
Publication:4770776
DOI10.1007/BF01580223zbMath0284.90057DBLPjournals/mp/HeldWC74WikidataQ56814043 ScholiaQ56814043MaRDI QIDQ4770776
Harlan P. Crowder, Michael Held, Philip Wolfe
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Preventive maintenance scheduling of power generating units ⋮ A Lagrangian heuristic for the capacitated plant location problem with single source constraints ⋮ Solving large-scale profit maximization capacitated lot-size problems by heuristic methods ⋮ Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes ⋮ The capacitated minimum spanning tree problem: On improved multistar constraints ⋮ A globally convergent method for solving a quartic generalized Markowitz portfolio problem ⋮ A monotonic, dual-based bounding procedure for integer programs ⋮ Dynamic supply chain design with inventory ⋮ Modeling and solving the rooted distance-constrained minimum spanning tree problem ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ Using integer programming techniques for the solution of an experimental design problem ⋮ Dynamic bundle methods ⋮ A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Algorithms for the solution of stochastic dynamic minimax problems ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Exact makespan minimization of unrelated parallel machines ⋮ Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints ⋮ Optimizing production capacity and safety stocks in general acyclic supply chains ⋮ Equitable routing of rail hazardous materials shipments using CVaR methodology ⋮ A Lagrangian decomposition scheme for choice-based optimization ⋮ Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs ⋮ A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball ⋮ Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A Lagrangian relaxation-based heuristic for the vehicle routing with full container load ⋮ On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ A variable target value method for nondifferentiable optimization ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Solving the swath segment selection problem through Lagrangean relaxation ⋮ An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. ⋮ Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem ⋮ A new cross decomposition method for stochastic mixed-integer linear programming ⋮ Stochastic facility location with general long-run costs and convex short-run costs ⋮ Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times ⋮ A two-echelon stochastic facility location model for humanitarian relief logistics ⋮ Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Performance evaluation for a transportation system in stochastic case ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Lagrangean relaxation heuristics for the \(p\)-cable-trench problem ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ An exact approach for scheduling jobs with regular step cost functions on a single machine ⋮ An integrated disaster preparedness model for retrofitting and relief item transportation ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ Bounds for the single source modular capacitated plant location problem ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Near-optimal solutions to large-scale facility location problems ⋮ Exact disclosure prevention in two-dimensional statistical tables ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ Planning capacity and safety stocks in a serial production-distribution system with multiple products ⋮ Alternate solution approaches for competitive hub location problems ⋮ An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem ⋮ Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop ⋮ Modeling formulation and a new heuristic for the railroad blocking problem ⋮ Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system ⋮ Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures ⋮ A new upper bound for the 0-1 quadratic knapsack problem ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ A note on a dynamic space-allocation method for outbound containers. ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Using short-term memory to minimize the weighted number of late jobs on a single machine. ⋮ SSN: learning sparse switchable normalization via SparsestMax ⋮ Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint ⋮ A fast algorithm for solving linear inverse problems with uniform noise removal ⋮ A primal-dual subgradient method for time staged capacity expansion planning ⋮ Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer ⋮ Future paths for integer programming and links to artificial intelligence ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ Multicast tree rearrangement to recover node failures in overlay multicast networks ⋮ The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Accelerating the convergence of subgradient optimisation ⋮ A multiperiod degree constrained minimal spanning tree problem ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems ⋮ Single machine scheduling with symmetric earliness and tardiness penalties ⋮ Solving the shortest route cut and fill problem using simulated annealing ⋮ Convergence analysis for the modified spectral projected subgradient method ⋮ An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Dynamic Programming Approach to Sequencing Problems
- Constructive Duality in Integer Programming
- Steepest Ascent for Large Scale Linear Programs
- Convex Analysis
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
This page was built for publication: Validation of subgradient optimization
