A weighted logarithmic barrier interior-point method for linearly constrained optimization

DOI10.24193/SUBBMATH.2021.4.14MaRDI QIDQ5101290zbMATH OpenOpenAlexFDO

Authors Selma Lamri, B. Merikhi, Mohamed Achache

Publication date 29 August 2022

Published in Studia Universitatis Babes-Bolyai Matematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.24193/subbmath.2021.4.14

zbMATH Keywords

interior-point methodslinearly constrained convex optimizationlogarithmic barrier method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• A weighted path-following method for linearly constrained convex programming
• A logarithm barrier function method
• One modification of the logarithmic barrier function method in linear and convex programming
• A primal-dual interior-point method for linear programming based on a weighted barrier function
• scientific article; zbMATH DE number 88933

Cited in

(3)

• A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial
• A weighted path-following method for linearly constrained convex programming

This page was built for publication: A weighted logarithmic barrier interior-point method for linearly constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101290)