Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
DOI10.1016/J.LAA.2013.02.015zbMATH Open1279.65081OpenAlexW2022400692MaRDI QIDQ393377FDOQ393377
Authors: Wenjuan Xue, Chungen Shen, Wenqiong Shao 
Publication date: 17 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2013.02.015
Recommendations
- The convergence of a modified barrier method for convex programming
- Barrier Functions in Interior Point Methods
- Analysis of the convergence of a class of barrier projection methods for linear programming problems
- Convergence rate for regularized arrier function methods
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- A note on the use of vector barrier parameters for interior-point methods
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming
- A polynomial-time interior-point method for conic optimization, with inexact barrier evaluations
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stability in the presence of degeneracy and error estimation
- Title not available (Why is that?)
- On the Accurate Identification of Active Constraints
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- Stabilized sequential quadratic programming
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Modifying SQP for Degenerate Problems
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Superlinear convergence of an interior-point method despite dependent constraints
- On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularized Newton method for degenerate unconstrained optimization problems
Cited In (1)
Uses Software
This page was built for publication: Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393377)
