Minimization of unsmooth functionals
From MaRDI portal
Publication:5637833
DOI10.1016/0041-5553(69)90061-5zbMath0229.65056OpenAlexW2130469840MaRDI QIDQ5637833
Publication date: 1971
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(69)90061-5
Related Items
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Gradient projection method with a new step size for the split feasibility problem, A dynamic programming method for single machine scheduling, On using approximations of the Benders master problem, Subgradient methods for sharp weakly convex functions, Subgradient algorithms for solving variable inequalities, On Poljak's improved subgradient method, A surrogate heuristic for set covering problems, A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces, Block-iterative surrogate projection methods for convex feasibility problems, On some difficult linear programs coming from set partitioning, Geometrically convergent projection method in matrix games, An iterative scheme for signal settings and network flows, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Convergence and computational analyses for some variable target value and subgradient deflection methods, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, An optimal scheme for toll pricing problem, Self-adaptive subgradient extragradient-type methods for solving variational inequalities, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, Efficient decomposition and linearization methods for the stochastic transportation problem, Channel allocation in cellular radio networks, Exact makespan minimization of unrelated parallel machines, Dual coordinate step methods for linear network flow problems, A generalized subgradient method with relaxation step, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Subgradient projection algorithms and approximate solutions of convex feasibility problems, Stochastic penalty function methods for nonsmooth constrained minimization, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Lagrangian dual ascent by generalized linear programming, Newton's method and its use in optimization, An exact algorithm for the capacitated facility location problems with single sourcing, A descent method with linear programming subproblems for nondifferentiable convex optimization, A subgradient method for multiobjective optimization on Riemannian manifolds, A globally convergent iterative scheme for toll design network with signal settings, Polyak's gradient method for split feasibility problem constrained by level sets, On descent-projection method for solving the split feasibility problems, Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach, A minimization method for the sum of a convex function and a continuously differentiable function, Numerical solution of huge-scale quasiseparable optimization problems, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Approximate level method for nonsmooth convex minimization, Subgradient method for convex feasibility on Riemannian manifolds, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, On the choice of step size in subgradient optimization, RAMP for the capacitated minimum spanning tree problem, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., Subgradient projectors: extensions, theory, and characterizations, Modified halfspace-relaxation projection methods for solving the split feasibility problem, Random algorithms for convex minimization problems, The gap function of a convex program, An infeasible-point subgradient method using adaptive approximate projections, A subgradient-like algorithm for solving vector convex inequalities, Variable target value subgradient method, Hilbertian convex feasibility problem: Convergence of projection methods, A Lagrangian relaxation approach for expansion of a highway network, A new halfspace-relaxation projection method for the split feasibility problem, Asynchronous Lagrangian scenario decomposition, 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 subgradient double projection method for variational inequalities in a Hilbert space, Projected subgradient minimization versus superiorization, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Linear mean value cross decomposition: A generalization of the Kornai- Liptak method, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Convergence of the surrogate Lagrangian relaxation 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, Acceleration procedure for special classes of multi-extremal problems, On embedding the volume algorithm in a variable target value method., Extrapolation algorithm for affine-convex feasibility problems, Benders decomposition, Lagrangean relaxation and metaheuristic design, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, 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, The Douglas-Rachford algorithm in the affine-convex case, A class of problems for which cyclic relaxation converges linearly, Heuristics for capacity planning problems with congestion, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators, Level bundle-like algorithms for convex optimization, Numerical study of high-dimensional optimization problems using a modification of Polyak's method, Lagrangean/surrogate relaxation for generalized assignment problems, Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review, Lagrangian relaxation of the generic materials and operations planning model, Conditional subgradient optimization -- theory and applications, Convergence of a generalized subgradient method for nondifferentiable convex optimization, A primal-dual subgradient method for time staged capacity expansion planning, Mean value cross decomposition applied to integer programming problems, The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem, Estimating the Held-Karp lower bound for the geometric TSP, Accelerating the convergence of subgradient optimisation, Random minibatch subgradient algorithms for convex problems with functional constraints, Primal convergence from dual subgradient methods for convex optimization, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, An improved subgradient method for constrained nondifferentiable optimization, On the finite convergence of a projected cutter method, Machine learning algorithms of relaxation subgradient method with space extension, Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Solving nonsmooth inclusions in the convex case, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Random and cyclic projection algorithms for variational inequalities, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, Superiorization with level control, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, A generalization of Polyak's convergence result for subgradient optimization, Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods, Scalable timing-aware network design via Lagrangian decomposition, Radial duality. II: Applications and algorithms, A review of decentralized optimization focused on information flows of decomposition algorithms, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Variance reduction for root-finding problems, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, Unnamed Item, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, String-averaging incremental stochastic subgradient algorithms, Relaxed inertial accelerated algorithms for solving split equality feasibility problem, A dual scheme for traffic assignment problems, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints, Optimal prioritized channel allocation in cellular mobile systems, A modified subgradient algorithm for Lagrangean relaxation, Probabilistic robust design with linear quadratic regulators, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions, Approximate subgradient methods for nonlinearly constrained network flow problems, A new forced LMS-based adaptive algorithm utilizing the principle of potential energy, On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces, Optimization of lipschitz continuous functions, Nonconvex Robust Low-Rank Matrix Recovery, A minisum location problem with regional demand considering farthest Euclidean distances, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Projection algorithms with dynamic stepsize for constrained composite minimization, On the convergence of the continuous gradient projection method, A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces, Algorithms for the quasiconvex feasibility problem, The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings, Weak subgradient method for solving nonsmooth nonconvex optimization problems, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, On Subgradient Projectors
