Pages that link to "Item:Q5637833"

The following pages link to Minimization of unsmooth functionals (Q5637833):

Displaying 50 items.

• Subgradient algorithms for solving variable inequalities (Q297868) (← links)
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
• A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921) (← links)
• Approximate level method for nonsmooth convex minimization (Q415377) (← links)
• Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
• Modified halfspace-relaxation projection methods for solving the split feasibility problem (Q447563) (← links)
• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• A subgradient-like algorithm for solving vector convex inequalities (Q467438) (← links)
• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
• On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
• A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
• Level bundle-like algorithms for convex optimization (Q743968) (← links)
• Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
• Gradient projection method with a new step size for the split feasibility problem (Q824578) (← 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)
• An optimal scheme for toll pricing problem (Q858765) (← links)
• Newton's method and its use in optimization (Q877590) (← links)
• A globally convergent iterative scheme for toll design network with signal settings (Q883922) (← links)
• Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
• Heuristics for capacity planning problems with congestion (Q1000984) (← links)
• On Poljak's improved subgradient method (Q1090617) (← links)
• Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) (← 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)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
• A minimization method for the sum of a convex function and a continuously differentiable function (Q1134011) (← links)
• On the choice of step size in subgradient optimization (Q1149883) (← links)
• The gap function of a convex program (Q1165158) (← links)
• Variable target value subgradient method (Q1174455) (← links)
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method (Q1203802) (← links)
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints (Q1214064) (← 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)
• Mean value cross decomposition applied to integer programming problems (Q1278589) (← links)
• Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
• An improved subgradient method for constrained nondifferentiable optimization (Q1317025) (← links)
• A dynamic programming method for single machine scheduling (Q1331548) (← links)
• On using approximations of the Benders master problem (Q1333479) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
• On some difficult linear programs coming from set partitioning (Q1348247) (← links)