-

 

 

 




Optimization Online





 

Convex and Nonsmooth Optimization Submissions - 2001

January 2001

Convex Optimization
Two properties of condition numbers for convex programs via implicitly defined barrier functions
Javier Pena

Convex Optimization
Non Convergence Result for Conformal Approximation of Variational Problems Subject to a Convexity Constraint
Philippe Choné, Hervé Le Meur

Convex Optimization
Convex optimization problems involving finite autocorrelation sequences
Brien Alkire, Lieven Vandenberghe


February 2001

Convex Optimization
A practical general approximation criterion for methods of multipliers based on Bregman distances
Jonathan Eckstein

Convex Optimization
Proving strong duality for geometric optimization using a conic formulation
François Glineur


March 2001

Convex Optimization
A conic formulation for $l_p$-norm optimization
François Glineur, Tamás Terlaky

Convex Optimization
Improving complexity of structured convex optimization problems using self-concordant barriers
François Glineur

A Bundle Method to Solve Multivalued Variational Inequalities
Genevieve SALMON, Jean-Jacques STRODIOT, Van Hien NGUYEN

Convex Optimization
Lagrangian relaxation
Claude Lemarechal


May 2001

Convex Optimization
Examples of ill-behaved central paths in convex optimization
J. Charles Gilbert, Clovis C. Gonzaga, Elizabeth Karas

Convex Optimization
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method
Olivier Péton, Jean-Philippe Vial

Nonsmooth Optimization
Optimal Stability and Eigenvalue Multiplicity
James V. Burke, Adrian S. Lewis, Michael L. Overton

Nonsmooth Optimization
Optimizing Matrix Stability
James V. Burke, Adrian S. Lewis, Michael L. Overton

Nonsmooth Optimization
Approximating Subdifferentials by Random Sampling of Gradients
James V. Burke, Adrian S. Lewis, Michael L. Overton

Nonsmooth Optimization
Two Numerical Methods for Optimizing Matrix Stability
James V. Burke, Adrian S. Lewis, Michael L. Overton


June 2001

Nonsmooth Optimization
Variational Analysis of Non-Lipschitz Spectral Functions
James V. Burke, Michael L. Overton

Nonsmooth Optimization
Variational Analysis of the Abscissa Mapping for Polynomials
James V. Burke, Michael L. Overton

Convex Optimization
On the convergence of the central path in semidefinite optimization
Margareta Halicka, Etienne De Klerk, Cornelis Roos


July 2001

Nonsmooth Optimization
Polynomial interior point cutting plane methods
John E. Mitchell


August 2001

Convex Optimization
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
Yu. E. Nesterov, M. J. Todd


September 2001

Nonsmooth Optimization
Strong semismoothness of eigenvalues of symmetric matrices and its application to inverse eigenvalue problems
Defeng Sun, Jie Sun


October 2001

Complexity of Convex Optimization using Geometry-based Measures and a Reference Point
Robert M. Freund

Convex Optimization
On Numerical Solution of the Maximum Volume Ellipsoid Problem
Yin Zhang, Liyan Gao


November 2001

The Volume Algorithm revisited: relation with bundle methods
Laura Bahiense, Nelson Maculan, Claudia Sagastizábal

Nonsmooth Optimization
Smoothing Method of Multipliers for Sum-Max Problems
Michael Zibulevsky


December 2001

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


  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