Sciweavers

433 search results - page 2 / 87
» Modified Line Search Method for Global Optimization
Sort
View
BMCV
2000
Springer
13 years 8 months ago
A New Line Segment Grouping Method for Finding Globally Optimal Line Segments
In this paper we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantage...
Jeong-Hun Jang, Ki-Sang Hong
SIAMJO
2010
88views more  SIAMJO 2010»
12 years 11 months ago
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
Hiroshi Yamashita, Takahito Tanabe
EOR
2010
160views more  EOR 2010»
13 years 4 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 4 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
MP
2010
135views more  MP 2010»
13 years 2 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal