On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-009-0168-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006548508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Algorithm for Nonlinear Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior method for nonconvex semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive linearization methods for nonlinear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3609101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5319006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential reduction algorithm for an extended SDP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method for nonlinear semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: First and second order analysis of nonlinear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Convergence of a Filter--SQP Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Filter-Trust-Region Method for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dwindling filter line search method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5432774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained optimization method using nonmonotone second order Goldstein's line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust region algorithm for equality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP 2.3 user's guide / rank
 
Normal rank

Latest revision as of 07:50, 2 July 2024

scientific article
Language Label Description Also known as
English
On filter-successive linearization methods for nonlinear semidefinite programming
scientific article

    Statements

    On filter-successive linearization methods for nonlinear semidefinite programming (English)
    0 references
    6 January 2010
    0 references
    The authors present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by \textit{R. Fletcher, S. Leyffer} and \textit{P. L. Toint} [SIAM J. Optim., 13, No.~1, 44--59 (2002; Zbl 1029.65063)]. The new method is shown to be globally convergent under certain weaker assumptions. Some preliminary numerical results indicate that the new method is promising, although further numerical experiments are necessary in order to get a more complete picture about the behavior of the method.
    0 references
    semidefinite programming
    0 references
    nonlinear optimization
    0 references
    successive linearization method
    0 references
    filter method
    0 references
    global convergence
    0 references
    trust region
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers