Abstract
In this paper we give a variant of the Topkis-Veinott method for solving inequality constrained optimization problems. This method uses a linearly constrained positive semidefinite quadratic problem to generate a feasible descent direction at each iteration. Under mild assumptions, the algorithm is shown to be globally convergent in the sense that every accumulation point of the sequence generated by the algorithm is a Fritz-John point of the problem. We introduce a Fritz-John (FJ) function, an FJ1 strong second-order sufficiency condition (FJ1-SSOSC), and an FJ2 strong second-order sufficiency condition (FJ2-SSOSC), and then show, without any constraint qualification (CQ), that (i) if an FJ point z satisfies the FJ1-SSOSC, then there exists a neighborhood N(z) of z such that, for any FJ point y ∈ N(z)\{z}, f0(y) ≠ f0(z), where f0is the objective function of the problem; (ii) if an FJ point z satisfies the FJ2-SSOSC, then z is a strict local minimum of the problem. The result (i) implies that the entire iteration point sequence generated by the method converges to an FJ point. We also show that if the parameters are chosen large enough, a unit step length can be accepted by the proposed algorithm.
Original language | English |
---|---|
Pages (from-to) | 309-330 |
Number of pages | 22 |
Journal | Applied Mathematics and Optimization |
Volume | 41 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jan 2000 |
Externally published | Yes |
Keywords
- Constrained optimization
- Feasibility
- Global convergence
- Stochastic programming
- Unit step
ASJC Scopus subject areas
- Control and Optimization
- Applied Mathematics