Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Conditional subgradient optimization - theory and applications

Article Abstract:

The subgradient projection method turns in a better performance than traditional subgradient optimization. This indicates that generalizing the subgradient optimization method for nondifferentiable convex programming to utilize conditional subgradients is effective in improving subgradient optimization schemes. It was applied in three areas, namely, uncapacitated facility location, two-person zero-sum matrix games and multicommodity network flows to examine its efficacy. The finding that it performs better than traditional subgradient optimization is significant since these schemes are widely used in Lagrangean relaxation.

Author: Larsson, Torbjorn, Stromberg, Ann-Brith, Patriksson, Michael
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Methods

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Accelerating the convergence of subgradient optimization

Article Abstract:

The method of exponential smoothing facilitates the convergence of subgradient optimization for a class of generalized assignment problems and capacitated warehouse location problems. It can also be used for other combinatorial optimization problems which could result to earlier fathoming in branch and bound algorithms. Its use opens a possibility that the effectiveness of Lagrangean heuristics can be enhanced.

Author: Baker, Barrie M., Sheasby, Janice
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Operations Research, Integer programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


On the convergence of conditional epselon-subgradient methods for convex programs and convex-concave saddle-point problems

Article Abstract:

The new convergence results for conditional epselon-subgradient algorithms for general convex programs are reported. The application of this technique to solve non-strictly convex-concave saddle point problems, such as primal-dual formulations of linear programs is established.

Author: Larsson, Torbjorn, Patrikkson, Michael, Stromberg, Ann-Brith
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
Linear programming, Usage, Game theory

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Mathematical optimization, Optimization theory, Convex programming
Similar abstracts:
  • Abstracts: Compass adds its final ingredient. Granada Food Services: catering for the new millennium. All the right ingredients: following its recent acquisition of the French contract catering company Eurest International, Compass Group is now the largest contract catering firm in the world
  • Abstracts: Rome-based bank IMI sold. Israel plans to intensify privatization transactions. Germany's Postbank confronts bid
  • Abstracts: Personal and professional values underlying ethical decisions: a comparison of American and Thai marketers. Some important factors underlying ethical decisions of Middle-Eastern marketers
  • Abstracts: Start digging: Indonesia plans a sharp expansion in gold output. Gold sealed
  • Abstracts: South Bank's festival spirit. Opera house urges speedy decision on Southwark site. Whitfield says Paternoster scheme is 'inappropriate.' (Sir William Whitfield)
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.