Some methods for solving nonsmooth convex minimization problems View on Open Library

Some methods for solving nonsmooth convex minimization problems

by John R. Birge , Liqun Qi , Zengxin Wei , University of Michigan. Dept. of Industrial and Operations Engineering

No reviews yet
First published: 1996 1 language
Subjects
Mathematical optimization Convex functions Convergence (Mathematics)

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by John R. Birge

An upper bound on the network recourse function

An upper bound on the network recourse f...

An upper bound on the expected value of a non-increasing convex function with convex marginal return functions

An upper bound on the expected value of ...

Option methods for incorporating risk into linear planning models

Option methods for incorporating risk in...

Stochastic programming approaches to stochastic scheduling

Stochastic programming approaches to sto...

Incorporating investment uncertainty into greenhouse policy models

Incorporating investment uncertainty int...

L-shaped method for two stage problems of stochastic convex programming

L-shaped method for two stage problems o...

You Might Also Like

More in Mathematical optimiz...
William Congreve

William Congreve

William Congreve
Recent Advances in Computational Optimization

Recent Advances in Computational Optimiz...

Stefka Fidanova
Let's Go 2001

Let's Go 2001

Harvard Student Agencies
Graphs, algorithms, and optimization

Graphs, algorithms, and optimization

William Kocay
Models, Algorithms and Technologies for Network Analysis

Models, Algorithms and Technologies for ...

Mikhail V. Batsyn
Introduction to Optimization

Introduction to Optimization

Edwin K. P. Chong