An interior method for nonconvex semidefinite programs (Q1863841): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Optimal design of trusses under a nonconvex global buckling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of the trust region problem by minimization over two-dimensional subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method based on interior point techniques for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Design of Columns Against Buckling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point method for multifractional programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal ellipsoidal approximations around the analytic center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Truss Design by Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Interior-Point Method for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free material optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LMI-Based Algorithm for Designing Suboptimal Static $\cal H_2/\cal H_\infty$ Output Feedback Controllers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of directions of negative curvature in a modified newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Optimization of Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective H/sub 2//H/sub ∞/ control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal interior point approach in convex programming (ill-posed problems)<sup>*</sup><sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of primal-dual interior-point methods to convex optimization problems in conic form / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of linear objective functions in barrier methods / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1011562523132 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2224084562 / rank
 
Normal rank

Latest revision as of 11:01, 30 July 2024

scientific article
Language Label Description Also known as
English
An interior method for nonconvex semidefinite programs
scientific article

    Statements

    An interior method for nonconvex semidefinite programs (English)
    0 references
    0 references
    12 March 2003
    0 references
    nonlinear optimization
    0 references
    semidefinite program
    0 references
    predictor corrector method
    0 references
    trust region method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references