-

 

 

 




Optimization Online





 

Optimization Online Digest — December 2001

Applications — Science and Engineering

Power transmission network design by a greedy randomized adaptive path relinking approach
Haroldo Faria Jr., Silvio Binato, Mauricio G. C. Resende

Combinatorial Optimization

A Laplace transform algorithm for the volume of a convex polytope
Jean B. Lasserre, Eduardo S. Zeron

Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut
Francisco Barahona, Lazslo Ladanyi

Complementarity and Variational Inequalities

A new class of proximal algorithms for the nonlinear complementarity problem
Geci Silva, Paulo Oliveira

Convex and Nonsmooth Optimization

Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem
Yair Censor, Tommy Elfving

Global Optimization

Semidefinite programming vs LP relaxations for polynomial programming
Jean B. Lasserre

A sequential convexification method (SCM) for continuous global optimization
Wenxing Zhu

Integer Programming

An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
Jean B. Lasserre

Linear, Cone and Semidefinite Programming

A Dynamic Large-Update Primal-Dual Interior-Point Method for Linear Optimization
Jiming Peng, Tamas Terlaky

[PENNON - A Generalized Augmented Lagrangian Methodfor Semidefinite Programming
Michal Kocvara, Michael Stingl

Nonlinear Optimization

A Comparative Study of Large-Scale Nonlinear Optimization Algorithms
H.Y. Benson, D.F. Shanno, R.J. Vanderbei

An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods
Paul Tseng

Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
Paul Tseng


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society