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