Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

SIAMJO
2000

favoriteEmaildiscussreport

88views more SIAMJO 2000»

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

13 years 4 months ago

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

Download www-rocq.inria.fr

Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generates feasible iterates and consists in computing approximate solutions of the optimality conditions perturbed by a sequence of positive parameters

Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea

Real-time Traffic

Analytic Center | Convex Function | Primal-dual Interior Point | SIAMJO 2000 |

claim paper

Related Content

» Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

» An Efficient InteriorPoint Method for Convex Multicriteria Optimization Problems

» Solving Image Registration Problems Using Interior Point Methods

» Proximity Queries between Convex Objects an Interior Point Approach for Implicit Surfaces

» A fast ndimensional rayshooting algorithm for grasping force optimization

» Multiple kernel learning conic duality and the SMO algorithm

» Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

» The Minimum Weight Triangulation Problem with Few Inner Points

» Removing Outliers to Minimize Area and Perimeter

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMJO
Authors	Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou

Comments (0)