scientific article; zbMATH DE number 3559294
From MaRDI portal
Publication:4132264
zbMath0358.90051MaRDI QIDQ4132264
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (71)
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ ON THE CONVERGENCE RATE OF THE SUBGRADIENT METHOD WITH METRIC VARIATION AND ITS APPLICATIONS IN NEURAL NETWORK APPROXIMATION SCHEMES ⋮ The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ Penalty-proximal methods in convex programming ⋮ Extension of some results for channel capacity using a generalized information measure ⋮ An optimal variant of Kelley's cutting-plane method ⋮ \(\epsilon\)-subgradient projection algorithm ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ A bundle modification strategy for convex minimization ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ A new nonsmooth bundle-type approach for a class of functional equations in Hilbert spaces ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ A method for convex minimization based on translated first-order approximations ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ A minimization method for the sum of a convex function and a continuously differentiable function ⋮ A simple version of bundle method with linear programming ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ A version of bundle trust region method with linear programming ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ An implementable algorithm for the optimal design centering, tolerancing, and tuning problem ⋮ Unnamed Item ⋮ Asynchronous level bundle methods ⋮ General Hölder smooth convergence rates follow from specialized rates assuming growth bounds ⋮ A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ A subgradient projection algorithm ⋮ Method of conjugate subgradients with constrained memory ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ Unnamed Item ⋮ Level-set methods for convex optimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ A single cut proximal bundle method for stochastic convex composite optimization ⋮ On the method of shortest residuals for unconstrained optimization ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ The noncooperative transportation problem and linear generalized Nash games ⋮ Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley ⋮ Stochastic dynamic cutting plane for multistage stochastic convex programs ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Hub-and-spoke network design and fleet deployment for string planning of liner shipping ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ On the properties of the method of minimization for convex functions with relaxation on the distance to extremum ⋮ Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm ⋮ Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization ⋮ Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions ⋮ Implementation of an oracle-structured bundle method for distributed optimization ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Essentials of numerical nonsmooth optimization ⋮ Synthesis of cutting and separating planes in a nonsmooth optimization method ⋮ A non-monotone conjugate subgradient type method for minimization of convex functions ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ An algorithm for minimizing a class of locally Lipschitz functions ⋮ Nondifferentiable optimization algorithm for designing control systems having singular value inequalities ⋮ Optimization of upper semidifferentiable functions ⋮ On a space extension algorithm for nondifferentiable optimization ⋮ Bimodal optimal design of vibrating plates using theory and methods of nondifferentiable optimization ⋮ Subgradient projection algorithm. II ⋮ A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Large-scale unit commitment under uncertainty ⋮ Descent algorithm for a class of convex nondifferentiable functions ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization ⋮ Machine learning algorithms of relaxation subgradient method with space extension
This page was built for publication:
