JSTOR Daily

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

A Bregman function is a strictly convex, differentiable function that induces a well-behaved distance measure or D-function on Euclidean space. This paper shows that, for every Bregman function, there ...
lse

Mathematical Programming: Theory and Algorithms

This course is available on the MSc in Applicable Mathematics, MSc in Management, MSc in Management (CEMS MIM), MSc in Management (MiM Exchange), MSc in Management Science (Operational Research), MSc ...
JSTOR Daily

SADDLE POINT CRITERIA AND THE EXACT MINIMAX PENALTY FUNCTION METHOD IN NONCONVEX PROGRAMMING

Abstract A new characterization of the exact minimax penalty function method is presented. The exactness of the penalization for the exact minimax penalty function method is analyzed in the context of ...
Business Wire

Research and Markets: Deterministic Operations Research: Models and Methods in Linear Optimization Is an Excellent Book for Operations Research of Linear Optimization Courses

DUBLIN--(BUSINESS WIRE)--Research and Markets(http://www.researchandmarkets.com/research/799091/deterministic_oper) has announced the addition of John Wiley and Sons ...