A new penalty function algorithm for convex quadratic programming
From MaRDI portal
Publication:1278947
DOI10.1016/S0377-2217(96)00138-5zbMath0916.90219OpenAlexW2004969600WikidataQ127358982 ScholiaQ127358982MaRDI QIDQ1278947
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00138-5
Related Items (5)
An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ Algorithm for inequality-constrained least squares problems ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ A new penalty function algorithm for convex quadratic programming ⋮ An exterior point polynomial-time algorithm for convex quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Exterior point algorithms for nearest points and convex quadratic programs
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new penalty function algorithm for convex quadratic programming
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- An approach to nonlinear programming
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- A Method of Solution for Quadratic Programs
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- A quadratic programming algorithm
- Note on Finite Convergence of Exterior Penalty Functions
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- A General Quadratic Programming Algorithm
This page was built for publication: A new penalty function algorithm for convex quadratic programming