A new penalty function algorithm for convex quadratic programming (Q1278947): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127358982, #quickstatements; #temporary_batch_1722291251637
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exterior point algorithms for nearest points and convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new penalty function algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Solution for Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving three classes of nonlinear programming problems via simple differentiable penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Finite Convergence of Exterior Penalty Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00138-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004969600 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127358982 / rank
 
Normal rank

Latest revision as of 12:48, 30 July 2024

scientific article
Language Label Description Also known as
English
A new penalty function algorithm for convex quadratic programming
scientific article

    Statements

    A new penalty function algorithm for convex quadratic programming (English)
    0 references
    0 references
    28 February 1999
    0 references
    Newton's method
    0 references
    convergence
    0 references
    exterior point algorithm
    0 references
    convex quadratic programming
    0 references
    penalty function
    0 references

    Identifiers