The following pages link to (Q5566712):
Displaying 50 items.
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- Stability of Polyak's algorithm in regular nonconvex problems (Q252658) (← links)
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- A coordinated planning model for the design of a distributed database system (Q707350) (← links)
- A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure (Q817543) (← links)
- Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality (Q833393) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- Regularized Newton method for unconstrained convex optimization (Q1016344) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- The equal flow problem (Q1108179) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- A method to find a point of a convex set (Q1116082) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
- Solution of a tinned iron purchasing problem by Lagrangean relaxation (Q1130077) (← links)
- Reflections on nondifferentiable optimization. II: Convergence (Q1131958) (← links)
- On the choice of step size in subgradient optimization (Q1149883) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- The \(K\)-coverage concentrator location problem (Q1193145) (← links)
- Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method (Q1203802) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- Primary and secondary route selection in backbone communication networks (Q1268202) (← links)
- Mean value cross decomposition applied to integer programming problems (Q1278589) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- The design of service systems with queueing time cost, workload capacities and backup service (Q1291646) (← links)
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint (Q1308878) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- On using approximations of the Benders master problem (Q1333479) (← links)
