Interior-Point l_2 Penalty Methods for Nonlinear Programming with Strong Global Convergence Properties

We propose two line search primal-dual interior-point methods that approximately solve a equence of equality constrained barrier subproblems. To solve each subproblem, our methods apply a modified Newton method and use an $\ell_2$-exact penalty function to attain feasibility. Our methods have strong global convergence properties under standard assumptions. Specifically, if the penalty parameter remains bounded, … Read more

Regularization Using a Parameterized Trust Region Subproblem

We present a new method for regularization of ill-conditioned problems, such as those that arise in image restoration or mathematical processing of medical data. The method extends the traditional {\em trust-region subproblem}, \TRS, approach that makes use of the {\em L-curve} maximum curvature criterion, a strategy recently proposed to find a good regularization parameter. We … Read more

On the convergence rate of the Cauchy algorithm in the l2 norm

This paper presents a convergence rate for the sequence generated by the Cauchy algorithm. The method is applied to a convex quadratic function with exact line search. Instead of using the norm induced by the hessian matrix, the q-linear convergence is shown for the l2 (or Euclidean) norm. CitationTecnhical Report, Dep. Mathematics, Federal University of … Read more

Transposition theorems and qualification-free optimality conditions

New theorems of the alternative for polynomial constraints (based on the Positivstellensatz from real algebraic geometry) and for linear constraints (generalizing the transposition theorems of Motzkin and Tucker) are proved. Based on these, two Karush-John optimality conditions — holding without any constraint qualification — are proved for single- or multi-objective constrained optimization problems. The first … Read more

Compact linearization for bilinear mixed-integer problems

We present a compact linearization for a broad class of bilinear 0-1 mixed-integer problems subject to assignment constraints. We apply the linearization to three classes of problems: quadratic assignment, multiprocessor scheduling with communication delays, and graph partitioning, and show that it yields faster solution times. CitationDEI, Politecnico di Milano, Working paper, April 2005.ArticleDownload View PDF

Solving Multi-Leader-Follower Games

Multi-leader-follower games arise when modeling competition between two or more dominant firms and lead in a natural way to equilibrium problems with equilibrium constraints (EPECs). We examine a variety of nonlinear optimization and nonlinear complementarity formulations of EPECs. We distinguish two broad cases: problems where the leaders can cost-differentiate and problems with price-consistent followers. We … Read more

Elastic-Mode Algorithms for Mathematical Programs with Equilibrium Constraints: Global Convergence and Stationarity Properties

The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the penalty parameter, local solutions satisfying first- and second-order necessary optimality conditions for the original problem are also first- and second-order points of the elastic-mode formulation. Here we study … Read more

Experimental Datasets from Chemical Thermodynamics

I have been working for quite awhile with the treatment of experimental results in chemical thermodynamics. I have tried to organize my archives and make them available for others. There are several experimental datasets in computer readable format and I hope that they can be used as useful benchmarks for data fitting and nonlinear optimization. … Read more

Variable metric method for minimization of partially separable nonsmooth functions.

In this report, we propose a new partitioned variable metric method for minimization of nonsmooth partially separable functions. After a short introduction, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Computational experiments given confirm efficiency and robustness of the new … Read more

Local Analysis of the Feasible Primal-Dual Interior-Point Method

In this paper we analyze the rate of local convergence of the Newton primal-dual interior-point method when the iterates are kept strictly feasible with respect to the inequality constraints. It is shown under the classical conditions that the rate is q-quadratic when the functions associated to the inequality constraints define a locally concave feasible region. … Read more