Low Order-Value Optimization and Applications

Given r real functions F1 (x), . . . , Fr (x) and an integer p between 1 and r, the Low Order- Value Optimization problem (LOVO) consists of minimizing the sum of the functions that take the p smaller values. If (y1 , . . . , yr ) is a vector of data … Read more

Density-based Globally Convergent Trust-Region Methods for Self-Consistent Field Electronic Structure Calculations

A theory of globally convergent trust-region methods for self-consistent field electronic structure calculations that use the density matrices as variables is developed. The optimization is performed by means of sequential global minimizations of a quadratic model of the true energy. The global minimization of this quadratic model, subject to the idempotency of the density matrix … Read more

Convergence analysis of a primal-dual interior-point method for nonlinear programming

We analyze a primal-dual interior-point method for nonlinear programming. We prove the global convergence for a wide class of problems under the standard assumptions on the problem. CitationTechnical Report ORFE-04-07, Department of ORFE, Princeton University, Princeton, NJ 08544ArticleDownload View PDF

An Analysis of the EM Algorithm andEntropy-Like Proximal Point Methods

The EM algorithm is a popular method for maximum likelihood estimation from incomplete data. This method may be viewed as a proximal point method for maximizing the log-likelhood function using an integral form of the Kullback-Leibler distance function. Motivated by this interpretation, we consider a proximal point method using an integral form of entropy-like distance … Read more

Convergence Results for Pattern Search Algorithms are Tight

Recently, general definitions of pattern search methods for both unconstrained and linearly constrained optimization were presented. It was shown under mild conditions, that there exists a subsequence of iterates converging to a stationary point. In the unconstrained case, stronger results are derived under additional assumptions. In this paper, we present three small dimensioned examples showing … Read more

Semismooth Support Vector Machines

The linear support vector machine can be posed as a quadratic program in a variety of ways. In this paper, we look at a formulation using the two-norm for the misclassification error that leads to a positive definite quadratic program with a single equality constraint when the Wolfe dual is taken. The quadratic term is … Read more