The Newton Bracketing method for the minimization of convex functions subject to affine constraints

13 years 4 months ago

Download benisrael.net

The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for affinely constrained Fermat

Adi Ben-Israel, Yuri Levin

Real-time Traffic

Constrained Convex Minimization | Constrained Fermatweber Location | Convex Functions | DAM 2008 |

claim paper

» Control formula for nonlinear systems subject to convex input constraints using control Ly...

» Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Sepa...

» A nonsmooth Newtons method for controlstate constrained optimal control problems

» Optimization over state feedback policies for robust control with constraints

» Probing the Pareto Frontier for Basis Pursuit Solutions

» Implicit nonlinear complementarity A new approach to contact dynamics

» Necessary and sufficient conditions for success of the nuclear norm heuristic for rank min...

» A New Low Rank QuasiNewton Update Scheme for Nonlinear Programming

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Adi Ben-Israel, Yuri Levin

Comments (0)

Sciweavers

The Newton Bracketing method for the minimization of convex functions subject to affine constraints

Constrained Convex Minimization | Constrained Fermatweber Location | Convex Functions | DAM 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Sciweavers

The Newton Bracketing method for the minimization of convex functions subject to affine constraints

Constrained Convex Minimization | Constrained Fermat­weber Location | Convex Functions | DAM 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Constrained Convex Minimization | Constrained Fermatweber Location | Convex Functions | DAM 2008 |