Back to search

Georgia Institute of Technology

Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming

Abstract

dc:description.abstract

The limiting behavior of weighted paths associated with the semidefinite program (SDP) map X1/2SX1/2 was studied and some applications to error bound analysis and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale well-structured sparse SDPs via a saddle point mirror-prox algorithm with {cal O}(epsilon-1) efficiency was developed based on exploiting sparsity structure and reformulating SDPs into smooth convex-concave saddle point problems. An iterative solver-based long-step primal-dual infeasible path-following algorithm for convex quadratic programming (CQP) was developed. The search directions of this algorithm were computed by means of a preconditioned iterative linear solver. A uniform bound, depending only on the CQP data, on the number of iterations performed by a preconditioned iterative linear solver was established. A polynomial bound on the number of iterations of this algorithm was also obtained. One efficient ``nearly exact' type of method for solving large-scale ``low-rank' trust region subproblems was proposed by completely avoiding the computations of Cholesky or partial Cholesky factorizations. A computational study of this method was also provided by applying it to solve some large-scale nonlinear programming problems.

Degree

thesis:*
Department dc:contributor.department
Industrial and Systems Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2005

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lu, Zhaosong
Advisors dc:contributor.advisor
  • Monteiro, Renato D. C.
  • Nemirovski, Arkadi
Committee members dc:contributor.committeemember
  • Barnes, Earl R.
  • Green, William
  • Shapiro, Alexander

Subjects

dc:subject × 8

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/7151

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lu, Zhaosong. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming. Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7151