A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CVXOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IMSL Numerical Libraries / 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.1007/s10107-012-0582-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111385217 / 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 Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996571 / 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: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / 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: Convex Analysis / 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: Approximation accuracy, gradient methods, and error bound for structured convex optimization / 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 08:15, 7 July 2024

scientific article
Language Label Description Also known as
English
A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
scientific article

    Statements

    A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (English)
    0 references
    0 references
    3 February 2014
    0 references
    smooth convex constrained minimization
    0 references
    quadratically constrained quadratic programming
    0 references
    sequential quadratic programming
    0 references
    convergence rate
    0 references
    optimal projected gradient schemes
    0 references

    Identifiers