Minimization of unsmooth functionals

Cited in

(only showing first 100 items - show all)

Heuristics for capacity planning problems with congestion
On Poljak's improved subgradient method
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
Dual coordinate step methods for linear network flow problems
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
Lagrangian dual ascent by generalized linear programming
An exact algorithm for the capacitated facility location problems with single sourcing
A minimization method for the sum of a convex function and a continuously differentiable function
On the choice of step size in subgradient optimization
The gap function of a convex program
Variable target value subgradient method
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
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
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
Conditional subgradient optimization -- theory and applications
Mean value cross decomposition applied to integer programming problems
Estimating the Held-Karp lower bound for the geometric TSP
An improved subgradient method for constrained nondifferentiable optimization
A dynamic programming method for single machine scheduling
On using approximations of the Benders master problem
A surrogate heuristic for set covering problems
Block-iterative surrogate projection methods for convex feasibility problems
On some difficult linear programs coming from set partitioning
Channel allocation in cellular radio networks
Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Subgradient methods for sharp weakly convex functions
Numerical solution of huge-scale quasiseparable optimization problems
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Subgradient projectors: extensions, theory, and characterizations
A relaxed projection method for solving multiobjective optimization problems
Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
The Douglas-Rachford algorithm in the affine-convex case
Lagrangean/surrogate relaxation for generalized assignment problems
A primal-dual subgradient method for time staged capacity expansion planning
Accelerating the convergence of subgradient optimisation
Geometrically convergent projection method in matrix games
Efficient decomposition and linearization methods for the stochastic transportation problem
A generalized subgradient method with relaxation step
Stochastic penalty function methods for nonsmooth constrained minimization
A descent method with linear programming subproblems for nondifferentiable convex optimization
On descent-projection method for solving the split feasibility problems
Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
Acceleration procedure for special classes of multi-extremal problems
Planning capacity and safety stocks in a serial production-distribution system with multiple products
General convergence analysis of stochastic first-order methods for composite optimization
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
Numerical study of high-dimensional optimization problems using a modification of Polyak's method
The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
Machine learning algorithms of relaxation subgradient method with space extension
Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
Self-adaptive subgradient extragradient-type methods for solving variational inequalities
Exact makespan minimization of unrelated parallel machines
Asynchronous Lagrangian scenario decomposition
The subgradient double projection method for variational inequalities in a Hilbert space
Projected subgradient minimization versus superiorization
Convergence of the surrogate Lagrangian relaxation method
Benders decomposition, Lagrangean relaxation and metaheuristic design
Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators
Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review
Lagrangian relaxation of the generic materials and operations planning model
Random minibatch subgradient algorithms for convex problems with functional constraints
Primal convergence from dual subgradient methods for convex optimization
On the finite convergence of a projected cutter method
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
An iterative scheme for signal settings and network flows
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
Polyak's gradient method for split feasibility problem constrained by level sets
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
RAMP for the capacitated minimum spanning tree problem
A new halfspace-relaxation projection method for the split feasibility problem
Extrapolation algorithm for affine-convex feasibility problems
Approximate subgradient methods for nonlinearly constrained network flow problems
Algorithms for the quasiconvex feasibility problem
Variance reduction for root-finding problems
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
A minisum location problem with regional demand considering farthest Euclidean distances
Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
Subgradient algorithms for solving variable inequalities
A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
A hybrid approach of bundle and Benders applied large mixed linear integer problem
Subgradient projection algorithms and approximate solutions of convex feasibility problems
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
A generalization of Polyak's convergence result for subgradient optimization
A subgradient method for multiobjective optimization on Riemannian manifolds
Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
Solving nonsmooth inclusions in the convex case
Approximate level method for nonsmooth convex minimization
Subgradient method for convex feasibility on Riemannian manifolds
Optimization of lipschitz continuous functions
An efficient lagrangean relaxation scheme for linear and integer equal flow problems
Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows

This page was built for publication: Minimization of unsmooth functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5637833)