scientific article; zbMATH DE number 3282977
From MaRDI portal
zbMath0177.15102MaRDI QIDQ5566712
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Method of generalized gradient descent, Composite optimization for the resource allocation problem, A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model, A generalization of Polyak's convergence result for subgradient optimization, Adaptive subgradient methods for mathematical programming problems with quasiconvex functions, Unnamed Item, Brève communication. Résolution numérique d'inégalités variationnelles, Online First-Order Framework for Robust Convex Optimization, Information-Theoretic Semi-Supervised Metric Learning via Entropy Regularization, Subgradient algorithms on Riemannian manifolds of lower bounded curvatures, The multi-hour service system design problem, On convergence rates of subgradient optimization methods, Single‐warehouse multi‐retailer inventory systems with full truckload shipments, Nonlinear programming methods in the presence of noise, A formula of the calculus of stochastic generalized gradients, Nesterov perturbations and projection methods applied to IMRT, Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints, Abstract convergence theorem for quasi-convex optimization problems with applications, Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces, Calculating surrogate constraints, Methods for solving fractional mathematical programming problems, Subdifferentials of functions on sets, Modifications and implementation of the ellipsoid algorithm for linear programming, Weak subgradient method for solving nonsmooth nonconvex optimization problems, Stochastic search methods for a most preferable element and their interactive interpretation, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications, Investigation of optimization methods and their applications, Validation of subgradient optimization, A Primal Approach to the Simple Plant Location Problem, On using approximations of the Benders master problem, Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality, A surrogate heuristic for set covering problems, A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process, Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints, Inexact subgradient methods for quasi-convex optimization problems, Convergence of inexact quasisubgradient methods with extrapolation, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, On some difficult linear programs coming from set partitioning, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Convergence and computational analyses for some variable target value and subgradient deflection methods, Solution procedures for the service system design problem, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, The equal flow problem, Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics, Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, A stochastic primal-dual method for a class of nonconvex constrained optimization, A method to find a point of a convex set, Routing and capacity assignment in backbone communication networks, A model for the capacitated \(p\)-facility location problem in global environments, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Lagrangian dual ascent by generalized linear programming, Solution of a tinned iron purchasing problem by Lagrangean relaxation, Algorithms for stochastic optimization with function or expectation constraints, Reflections on nondifferentiable optimization. II: Convergence, The CoMirror algorithm for solving nonsmooth constrained convex problems, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Use of Lagrangian decomposition in supply chain planning, Applying the Gradient Projection Method to a Model of Proportional Membership for Fuzzy Cluster Analysis, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, On the choice of step size in subgradient optimization, Stochastic first-order methods for convex and nonconvex functional constrained optimization, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., Recursive algorithms for inner ellipsoidal approximation of convex polytopes., Approximate solutions to large scale capacitated facility location problems, An infeasible-point subgradient method using adaptive approximate projections, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, Variable target value subgradient method, A variable target value method for nondifferentiable optimization, A multiple server location-allocation model for service system design, Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths, The \(K\)-coverage concentrator location problem, Topological design of computer communication networks -- the overall design problem, A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints, Nonsmooth Optimization, Mixed-integer bilinear programming problems, Comparison of bundle and classical column generation, 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, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Nonsmooth nonconvex global optimization in a Banach space with a basis, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, A coordinated planning model for the design of a distributed database system, Non-Euclidean restricted memory level method for large-scale convex optimization, Approximate subgradient methods for nonlinearly constrained network flow problems, A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract, Minimization methods with constraints, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Primal-dual subgradient methods for convex problems, A class of problems for which cyclic relaxation converges linearly, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Level bundle-like algorithms for convex optimization, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, Regularized Newton method for unconstrained convex optimization, Two ``well-known properties of subgradient optimization, Conditional subgradient optimization -- theory and applications, Primary and secondary route selection in backbone communication networks, On the determination of the minimum of a convex piecewise-differentiable function, Convergence of a generalized subgradient method for nondifferentiable convex optimization, A primal-dual subgradient method for time staged capacity expansion planning, Generalized descent method for minimization of functionals, Mean value cross decomposition applied to integer programming problems, New approach to comparison of search methods used in nonlinear programming problems, On the projected subgradient method for nonsmooth convex optimization in a Hilbert space, A constrained nonlinear 0-1 program for data allocation, Estimating the Held-Karp lower bound for the geometric TSP, The design of service systems with queueing time cost, workload capacities and backup service, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, Convergence rates of subgradient methods for quasi-convex optimization problems, On the convergence of a class of outer approximation algorithms for convex programs, Optimization of upper semidifferentiable functions, Routing and capacity assignment in backbone communication networks under time varying traffic conditions, Accelerating the convergence of subgradient optimisation, An integrated approach for planning the adoption of client/server systems, Random minibatch subgradient algorithms for convex problems with functional constraints, Primal convergence from dual subgradient methods for convex optimization, Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, A model and methodologies for the location problem with logistical components, Stability of Polyak's algorithm in regular nonconvex problems, Convergence of some algorithms for convex minimization, Convergence analysis for the modified spectral projected subgradient method, Designing a distribution network in a supply chain system: formulation and efficient solution procedure, An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
