A new penalty function algorithm for convex quadratic programming-Reference-Cited by-同舟云学术

A new penalty function algorithm for convex quadratic programming

Published:1997-08 Issue:1 Volume:101 Page:155-163
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ben-Daya M.,Al-Sultan K.S.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference23 articles.

1. Exterior point algorithms for nearest points and convex quadratic programming;Al-Sultan;Mathematical Programming,1991

2. On the ϵ-convergence of exterior penalty functions;Al-Sultan;Arabian Journal of Science and Engineering,1994

3. Om minimizing a convex function subject to linear inequalities;Beale;J. Royal Statistical Society,1955

4. A new exterior point algorithm for convex quadratic programming;Ben Daya,1992

5. Polynomial barrier function algorithms for convex quadratic programming;Ben Daya;Arabian Journal of Science and Engineering,1990

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring Uncertainty, Sensitivity and Robust Solutions in Mathematical Programming Through Bayesian Analysis;Computational Economics;2022-06-10

2. An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming;Numerical Analysis and Applications;2022-06

3. Algorithm and separating method for the optimisation of quadratic functions;International Journal of Computing Science and Mathematics;2017

4. Algorithm for inequality-constrained least squares problems;Computational and Applied Mathematics;2015-04-09

5. An exterior point polynomial-time algorithm for convex quadratic programming;Computational Optimization and Applications;2014-10-24