Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GQTPAR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109910358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMIT-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second-order method for the discrete min-max problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some methods of solving convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined phase I—phase II methods of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sequential Quadratically Constrained Quadratic Programming Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization / rank
 
Normal rank

Latest revision as of 07:27, 2 July 2024

scientific article
Language Label Description Also known as
English
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
scientific article

    Statements

    Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    optimization
    0 references
    quadratically constrained quadratic programming
    0 references
    SQCQP
    0 references
    superlinear convergence
    0 references
    norm-relaxed algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references