Minimization of unsmooth functionals

Cited in

(only showing first 100 items - show all)

A generalized subgradient method with relaxation step
Gradient projection method with a new step size for the split feasibility problem
General convergence analysis of stochastic first-order methods for composite optimization
Radial duality. II: Applications and algorithms
Accelerating level-value adjustment for the Polyak stepsize
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
RAMP for the capacitated minimum spanning tree problem
Exact makespan minimization of unrelated parallel machines
An improved subgradient method for constrained nondifferentiable optimization
On the convergence of the continuous gradient projection method
On the finite convergence of a projected cutter method
On embedding the volume algorithm in a variable target value method.
Mini-batch stochastic subgradient for functional constrained optimization
A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
Subgradient projectors: extensions, theory, and characterizations
A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
Projected subgradient minimization versus superiorization
Subgradient method for convex feasibility on Riemannian manifolds
Level bundle-like algorithms for convex optimization
Machine learning algorithms of relaxation subgradient method with space extension
Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
An optimal scheme for toll pricing problem
A generalization of Polyak's convergence result for subgradient optimization
An iterative scheme for signal settings and network flows
scientific article; zbMATH DE number 7656028 (Why is no real title available?)
A minimization method for the sum of a convex function and a continuously differentiable function
A subgradient method for multiobjective optimization on Riemannian manifolds
Acceleration procedure for special classes of multi-extremal problems
Algorithms for the quasiconvex feasibility problem
Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
Dual coordinate step methods for linear network flow problems
An exact algorithm for the capacitated facility location problems with single sourcing
A modified subgradient algorithm for Lagrangean relaxation
Optimal prioritized channel allocation in cellular mobile systems
String-averaging incremental stochastic subgradient algorithms
Weak, strong, and linear convergence of a double-layer fixed point algorithm
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Subgradient methods for sharp weakly convex functions
Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
Lagrangian dual ascent by generalized linear programming
Solving nonsmooth inclusions in the convex case
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
Projection algorithms with dynamic stepsize for constrained composite minimization
A surrogate heuristic for set covering problems
Subgradient algorithms for solving variable inequalities
Geometrically convergent projection method in matrix games
The subgradient double projection method for variational inequalities in a Hilbert space
A review of decentralized optimization focused on information flows of decomposition algorithms
Heuristics for capacity planning problems with congestion
Variable target value subgradient method
Algorithms and applications for split equality problem with related problems
Probabilistic robust design with linear quadratic regulators
Hilbertian convex feasibility problem: Convergence of projection methods
A subgradient-like algorithm for solving vector convex inequalities
Conditional subgradient optimization -- theory and applications
Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A class of problems for which cyclic relaxation converges linearly
Approximate level method for nonsmooth convex minimization
Planning capacity and safety stocks in a serial production-distribution system with multiple products
Modified halfspace-relaxation projection methods for solving the split feasibility problem
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
On descent-projection method for solving the split feasibility problems
Contemporary approaches in matheuristics an updated survey
Self-adaptive subgradient extragradient-type methods for solving variational inequalities
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
An infeasible-point subgradient method using adaptive approximate projections
Accelerating the convergence of subgradient optimisation
A globally convergent iterative scheme for toll design network with signal settings
Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
Random minibatch subgradient algorithms for convex problems with functional constraints
Solving LTPSOP in open-pit mines using Gaussian process and human mental search
Stochastic penalty function methods for nonsmooth constrained minimization
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
Primal convergence from dual subgradient methods for convex optimization
Mean value cross decomposition applied to integer programming problems
Random algorithms for convex minimization problems
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
A relaxed projection method for solving multiobjective optimization problems
Asynchronous Lagrangian scenario decomposition
Lagrangean/surrogate relaxation for generalized assignment problems
Channel allocation in cellular radio networks
Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review
An efficient lagrangean relaxation scheme for linear and integer equal flow problems
Estimating the Held-Karp lower bound for the geometric TSP
Convergence of a generalized subgradient method for nondifferentiable convex optimization
Convergence and computational analyses for some variable target value and subgradient deflection methods
Newton's method and its use in optimization
Relaxed inertial accelerated algorithms for solving split equality feasibility problem
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Near-optimal closed-loop method via Lyapunov damping
Approximate subgradient methods for nonlinearly constrained network flow problems
Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
Numerical study of high-dimensional optimization problems using a modification of Polyak's method
The Douglas-Rachford algorithm in the affine-convex case

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)