We study a trust region affine scaling algorithm for solving the linearly constrained convex or concave programming problem. Under primal nondegeneracy assumption, we prove that every accumulation point of the sequence generated by the algorithm satisfies the first order necessary condition for optimality of the problem. For a special class of convex or concave functions satisfying a certain invariance condition on their Hessians, it is shown that the sequences of iterates and objective function values generated by the algorithm converge R-linearly and Q-linearly, respectively. Moreover, under primal nondegeneracy and for this class of objective functions, it is shown that the limit point of the sequence of iterates satisfies the first and second order necessary conditions for optimality of the problem. Key words: Linearly constrained problem, affine scaling algorithm, trust region method, interior point method.
|
658
|
Practical methods of optimization
– Fletcher
- 1987
|
|
457
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
242
|
An algorithm for least-squares estimation of nonlinear parameters
– Marquardt
- 1963
|
|
135
|
Computing a trust region step
– More, Sorensen
- 1983
|
|
89
|
Iterative solutions of problems of linear and quadratic programming
– Dikin
- 1967
|
|
71
|
A method for the solution of certain nonlinear problems in least squares,” Quarterly
– Levenberg
- 1944
|
|
63
|
Computing optimal locally constrained steps
– Gay
- 1981
|
|
55
|
A variation on Karmarkar’s algorithm for solving linear programming problems
– Barnes
- 1986
|
|
49
|
A modification of Karmarkar's linear programming algorithm", Algorithmica 1
– Vanderbei, Meketon, et al.
- 1986
|
|
48
|
An implementation of Karmarkar's algorithm for linear programming", Mathematical Programming 44
– Adler, Resende, et al.
- 1989
|
|
45
|
The nonlinear geometry of linear programming. III. Projective Legendre transform coordinates and Hilbert geometry
– Bayer, Lagarias
- 1990
|
|
34
|
A continuous approach to inductive inference
– Kamath, Karmarkar, et al.
- 1992
|
|
28
|
A family of trustregion-based algorithms for unconstrained minimization with strong convergence properties
– Schultz, Schnabel, et al.
- 1985
|
|
25
|
An interior point algorithm to solve computationally difficult set covering problems
– Karmarkar, Resende, et al.
- 1991
|
|
24
|
Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems
– Tsuchiya, Muramatsu
- 1995
|
|
22
|
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
– Adler, Monteiro
- 1991
|
|
21
|
The Levenberg-Marquardt algorithm: Implementation and theory
– Mor
- 1977
|
|
17
|
Boundary behavior of interior point algorithms in linear programming
– Megiddo, Shub
- 1989
|
|
16
|
A simplified global convergence proof of the affine scaling algorithm
– Monteiro, Tsuchiya, et al.
- 1993
|
|
13
|
Dikin's convergence result for the affine-scaling algorithm
– Vanderbei, Lagarias, et al.
- 1990
|
|
10
|
An extension of Karmarkar's projective algorithm for convex quadratic programming
– Ye, Tse
- 1989
|
|
9
|
Computational experience with a dual affine variant of Karmarkar's method for linear programming
– Monma, Morton
- 1987
|
|
8
|
Trust region methods for unconstrained optimization
– Sorensen
- 1982
|
|
8
|
On the convergence of the affine--scaling algorithm
– Tseng, Luo
- 1992
|
|
7
|
Zorkalcev, Iterative Solution of Mathematical Programming Problems: Algorithms for the Method of Interior Points (in Russian
– Dikin, I
- 1980
|
|
6
|
Convergence and boundary behavior of the projective scaling trajectories for linear programming
– Monteiro
- 1991
|
|
6
|
Superlinear primal-dual affine scaling algorithms for
– Monteiro, Wright
- 1993
|
|
6
|
A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
– Sun
- 1993
|
|
5
|
Convergence of the large step primal affine-scaling algorithm for primal nondegenerate linear programs
– Gonzaga
- 1990
|
|
5
|
Global convergence of the affine scaling algorithm for convex quadratic programming
– Monteiro, Tsuchiya
- 1995
|
|
5
|
Superlinear convergence of the affine scaling algorithm
– Tsuchiya, Monteiro
- 1996
|
|
5
|
On the convergence behavior of trajectories for linear programming
– Witzgall, Boggs, et al.
- 1990
|
|
4
|
The trust region affine interior point algorithm for nonconvex quadratic programming
– Bonnans, Bouhtou
- 1995
|
|
4
|
On the Solution of Indefinite Quadratic Problems using an Interior-Point Algorithm
– Han, Pardalos, et al.
- 1992
|
|
4
|
Global convergence of the affine--scaling methods for degenerate linear programming problems
– Tsuchiya
- 1991
|
|
4
|
convergence property of the affine scaling method for primal degenerate linear programming problems
– Global
- 1992
|
|
3
|
A primal affine--scaling algorithm for linearly constrained convex programs
– Gonzaga, Carlos
- 1990
|
|
3
|
Interior point methods for global optimization problems
– Pardalos, Resende
- 1996
|
|
1
|
The affine scaling algorithm fails for = :999, technical report, Universidade Estadual de
– Mascarenhas
- 1993
|
|
1
|
convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
– Global
- 1993
|
|
1
|
an affine scaling algorithm for nonconvex quadratic programming
– On
- 1992
|
