Minimization of unsmooth functionals

Cited in

(only showing first 100 items - show all)

General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
Efficient decomposition and linearization methods for the stochastic transportation problem
Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
On Poljak's improved subgradient method
On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
A new halfspace-relaxation projection method for the split feasibility problem
A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
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
Random and cyclic projection algorithms for variational inequalities
A dynamic programming method for single machine scheduling
Lipschitz continuity of the metric projection operator and convergence of gradient methods
On subgradient projectors
Interpolating between optimal transport and KL regularized optimal transport using Rényi divergences
Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
On the choice of step size in subgradient optimization
Numerical solution of huge-scale quasiseparable optimization problems
Halpern-type Bregman projection algorithms for split variational inequality problems
A minisum location problem with regional demand considering farthest Euclidean distances
Lagrangian relaxation of the generic materials and operations planning model
Polyak's gradient method for split feasibility problem constrained by level sets
Strong convergence of Bregman projection algorithms for solving split feasibility problems
On using approximations of the Benders master problem
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
A hybrid approach of bundle and Benders applied large mixed linear integer problem
On constructing a gradient quadratic optimization method that is optimal in terms of distance to the exact solution
The gap function of a convex program
Exact Lipschitz regularization of convex optimization problems
Polyak minorant method for convex optimization
The ``black-box optimization problem: zero-order accelerated stochastic method via kernel approximation
Variance reduction for root-finding problems
Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators
A primal-dual subgradient method for time staged capacity expansion planning
On some difficult linear programs coming from set partitioning
The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
Subgradient projection algorithms and approximate solutions of convex feasibility problems
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
Weak subgradient method for solving nonsmooth nonconvex optimization problems
A descent method with linear programming subproblems for nondifferentiable convex optimization
A Lagrangian relaxation approach for expansion of a highway network
Convergence of the surrogate Lagrangian relaxation method
Benders decomposition, Lagrangean relaxation and metaheuristic design
Nonlinear tomographic reconstruction via nonsmooth optimization
A new forced LMS-based adaptive algorithm utilizing the principle of potential energy
Scalable timing-aware network design via Lagrangian decomposition
Nonconvex Robust Low-Rank Matrix Recovery
A dual scheme for traffic assignment problems
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
Superiorization with level control
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
Extrapolation algorithm for affine-convex feasibility problems
Optimization of lipschitz continuous functions
Stochastic dual dynamic programming and its variants: a review
Random and cyclic projection algorithms for strongly pseudomonotone variational inequalities
Block-iterative surrogate projection methods for convex feasibility problems
Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
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

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)