A Primal-Dual Exterior Point Method for Nonlinear Optimization

  title={A Primal-Dual Exterior Point Method for Nonlinear Optimization},
  author={Hiroshi Yamashita and Takahito Tanabe},
  journal={SIAM J. Optim.},
In this paper, primal-dual methods for general nonconvex nonlinear optimization problems are considered. The proposed methods are exterior point type methods that permit primal variables to violate inequality constraints during the iterations. The methods are based on the exact penalty type transformation of inequality constraints and use a smooth approximation of the problem to form primal-dual iteration based on Newton's method as in usual primal-dual interior point methods. Global… 

Tables from this paper

An interior point method for nonlinear programming with infeasibility detection capabilities
This paper describes an interior point method for nonlinear programming endowed with infeasibility detection capabilities and uses a step-decomposition interior-point approach in which the step is the sum of a normal component and a tangential component.
A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
A line search algorithm for large-scale constrained optimization that is robust and efficient even for problems with (nearly) rank-deficient Jacobian matrices and is globally convergent to first-order optimal points or to stationary points of an infeasibility measure is presented.
An entire space polynomial-time algorithm for linear programming
  • D. Tian
  • Computer Science, Mathematics
    J. Glob. Optim.
  • 2014
By taking a parameter large enough, the optimal solution for the unconstrained optimization problem is located in the increasing interval of the self-concordant function, which ensures the feasibility of solutions.
An exterior point polynomial-time algorithm for convex quadratic programming
  • D. Tian
  • Mathematics, Computer Science
    Comput. Optim. Appl.
  • 2015
This paper converts a convex quadratic program into an unconstrained convex program problem with a self-concordant objective function and shows that, only with duality, the Path-following method is valid.
Learning Latent Variable Models by Improving Spectral Solutions with Exterior Point Method
This work introduces a two-stage learning algorithm for latent variable models that first uses a spectral method of moments algorithm to find a solution that is close to the optimal solution but not necessarily in the valid set of model parameters.
Embedding Ordinal Optimization into Tree-Seed Algorithm for Solving the Probabilistic Constrained Simulation Optimization Problems
A method that embeds ordinal optimization into tree–seed algorithm (TSA) (OOTSA) is proposed for solving the PCSOP and demonstrates that the OOTSA method yields an outstanding solution of much higher computing efficiency with much higher quality than three heuristic approaches.
Faster Matchings via Learned Duals
A rigorous, practical, and empirically effective method to compute bipartite matchings, and a first step in this direction by combining the idea of machine-learned predictions with the “warm-starting" primal-dual algorithms.
Optimal trajectory planning in partially observable environments under bounded actuation
Optimal motion planning under uncertainty is a challenging problem, in particular if the optimization has to be performed on the belief space. One state of the art approach to this problem is an
A Parametric Level-Set Approach to Simultaneous Object Identification and Background Reconstruction for Dual-Energy Computed Tomography
A novel polychromatic dual-energy processing algorithm, with an emphasis on detection and characterization of piecewise constant objects embedded in an unknown cluttered background, that successfully detects objects of interest, finds their shape and location, and gives an adequate reconstruction of the background.


An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
A new primal-dual merit function is proposed, called the primal- DUal quadratic barrier penalty function, framework of line search methods, and the global convergence properties of the method are shown.
A globally convergent primal-dual interior point method for constrained optimization
This paper proposes a primal-dual interior point method for solving general nonlinearly constrained optimization problems. The method is based on solving the Barrier Karush-Kuhn-Tucker conditions for
A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
A primal-dual interior point method for solving large scale nonlinearly constrained optimization problems that uses second derivatives of functions for minimizing the barrier-penalty function instead of line search strategies is proposed.
Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization
This paper proves local convergence rates of primal-dual interior point methods for general nonlinearly constrained optimization problems by proving local and quadratic convergence of the Newton method and local and superlinear converge of the quasi-Newton method.
An Interior-Point l 1 -Penalty Method for Nonlinear Optimization
A mixed interior/exterior-point method for nonlinear programming that handles constraints by way of an l1-penalty function that may be solved using interior-point techniques as finding a strictly feasible point is trivial.
Quadratic Convergence of a Primal-Dual Interior Point Method for Degenerate Nonlinear Optimization Problems
By controlling a barrier parameter and adopting a suitable line search procedure, this paper proves the quadratic convergence of the proposed algorithm.
Interior-point ℓ2-penalty methods for nonlinear programming with strong global convergence properties
Two line search primal-dual interior-point methods for nonlinear programming that approximately solve a sequence of equality constrained barrier subproblems and have strong global convergence properties under standard assumptions are proposed.
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
A comprehensive description of the primal-dual interior-point algorithm with a filter line-search method for nonlinear programming is provided, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix.
Interior point methods for large-scale nonlinear programming
An algorithm for solving nonlinear nonconvex programming problems, which is based on the interior point approach, and a new merit function is defined and a filter principle is used for step-length selection.
Warm start of the primal-dual method applied in the cutting-plane scheme
A practical warm-start procedure is described for the infeasible primal-dual interior-point method (IPM) employed to solve the restricted master problem within the cutting-plane method. In contrast