An interior point method for nonlinear optimization with a quasi-tangential subproblem
From MaRDI portal
Abstract: In this paper, we proposed an interior point method for constrained optimization, which is characterized by the using of quasi-tangential subproblem. This algorithm follows the main ideas of primal dual interior point methods and Byrd-Omojokun's step decomposition strategy. The quasi-tangential subproblem is obtained by penalizing the null space constraint in the tangential subproblem. The resulted quasi-tangential step is not strictly lying in the null space of the gradients of constraints. We also use a line search trust-funnel-like strategy, instead of penalty function or filter technology, to globalize the method. Global convergence results were obtained under standard assumptions.
Recommendations
- An interior-point trust-funnel algorithm for nonlinear optimization
- Feasible direction interior-point technique for nonlinear optimization
- scientific article; zbMATH DE number 5233132
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- A trust region method based on interior point techniques for nonlinear programming.
Cites work
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 1183039 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A method for the solution of certain non-linear problems in least squares
- A new penalty-free-type algorithm based on trust region techniques
- A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
- A numerical approach to optimization problems with variational inequality constraints
- A penalty-function-free line search SQP method for nonlinear programming
- A primal-dual regularized interior-point method for convex quadratic programs
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A smoothing method for mathematical programs with equilibrium constraints
- A trust region method based on interior point techniques for nonlinear programming.
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An Inexact Trust-Region SQP Method with Applications to PDE-Constrained Optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- An interior point method for nonlinear programming with infeasibility detection capabilities
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- An interior-point trust-funnel algorithm for nonlinear optimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- Exact Regularization of Convex Programs
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Interior point methods 25 years later
- LOQO:an interior point code for quadratic programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Modifying SQP for Degenerate Problems
- Nonlinear programming without a penalty function or a filter
- Numerical Optimization
- On Optimization Problems with Variational Inequality Constraints
- On the convergence properties of the Levenberg–Marquardt method
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Stabilized sequential quadratic programming
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Symmetric Quasidefinite Matrices
Cited in
(3)
This page was built for publication: An interior point method for nonlinear optimization with a quasi-tangential subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689438)
