Results 181 to 190 of about 2,178 (210)
Some of the next articles are maybe not open access.

A Subgradient Method for Vector Optimization Problems

SIAM Journal on Optimization, 2013
Vector optimization problems are a significant extension of scalar optimization and have many real life applications. We consider an extension of the projected subgradient method to convex vector optimization, which works directly with vector-valued functions, without using scalar-valued objectives.
openaire   +1 more source

Nondifferentiable Optimisation Subgradient and ε — Subgradient Methods

1976
We give some ideas which lead to descent methods for minimizing nondifferentiable functions. Such methods have been published in several papers and they all involve the same concept, namely the e — subdifferential.
openaire   +1 more source

Subgradient Method for Convex Feasibility on Riemannian Manifolds

Journal of Optimization Theory and Applications, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Glaydston de Carvalho Bento   +1 more
openaire   +1 more source

A Subgradient Method for Multiobjective Optimization on Riemannian Manifolds

Journal of Optimization Theory and Applications, 2013
The authors propose a subgradient-type method for solving a multiobjective optimization problem whose objective function, \(F=(f_1,\dots,f_m) : M \to \mathbb{R}^m\), is convex on an \(n\)-dimensional Riemannian manifold \(M\) (i.e., componentwise convex along geodesic segments joining any points of \(M\)).
Glaydston de Carvalho Bento   +1 more
openaire   +2 more sources

A generalized subgradient method with relaxation step

Mathematical Programming, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Subgradient Methods for the Service Network Design Problem

Transportation Science, 1994
We present local-improvement heuristics for a Service Network Design Problem encountered in the motor carrier industry. The scheduled set of vehicle departures determines the right hand side of the capacity constraints of the shipment routing subproblem which is modeled as a multicommodity network flow problem.
Judith M. Farvolden, Warren B. Powell
openaire   +1 more source

On the solution of the generalized steiner problem by the subgradient method

ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
The paper is concerned with the problem of constructing a minimal cost weighted tree connecting a set of n given terminal vertices on a Euclidean plane. The authors prove that the problem is convex and that its solution is in the convex hull of the given terminal vertices and that the necessary and sufficient optimality conditions can be expressed by ...
Flavia Donno, Giancarlo Pesamosca
openaire   +2 more sources

A Note on the Convergence of Subgradient Optimization Methods

Mathematische Operationsforschung und Statistik. Series Optimization, 1983
The author considers the problem of minimizing a closed proper convex function on \({\mathbb{R}}^ n\) over a closed convex set C. For this purpose the subgradient algorithm can be used. The theoretical convergence of this algorithm and its rate depends essentially on the choice of the step size. The purpose of this note is to present conditions for the
openaire   +2 more sources

Continuous Subgradient Method

2016
In this chapter we study the continuous subgradient algorithm for minimization of convex functions, under the presence of computational errors. We show that our algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant.
openaire   +1 more source

A Proximal Bundle Method Based on Approximate Subgradients

Computational Optimization and Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Home - About - Disclaimer - Privacy