An interior method for nonconvex semidefinite programs
From MaRDI portal
Recommendations
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- Noninterior continuation method for solving semidefinite programming
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- A primal-dual interior point method for nonlinear semidefinite programming
Cites work
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 4076973 (Why is no real title available?)
- scientific article; zbMATH DE number 1183048 (Why is no real title available?)
- scientific article; zbMATH DE number 1186888 (Why is no real title available?)
- scientific article; zbMATH DE number 1186894 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- A Practical Interior-Point Method for Convex Programming
- A new polynomial-time algorithm for linear programming
- A projected gradient algorithm for solving the maxcut SDP relaxation
- A trust region method based on interior point techniques for nonlinear programming.
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- An LMI-based algorithm for designing suboptimal static \(\mathcal H_2/\mathcal H_\infty\) output feedback controllers
- An interior-point algorithm for nonconvex nonlinear programming
- An interior-point method for multifractional programs with convex constraints
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
- Computing a Trust Region Step
- Free material optimization
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- Large-Scale Optimization of Eigenvalues
- Multiobjective H/sub 2//H/sub ∞/ control
- On the Optimal Design of Columns Against Buckling
- On the use of directions of negative curvature in a modified newton method
- Optimal Truss Design by Interior-Point Methods
- Optimal design of trusses under a nonconvex global buckling constraint
- Optimal ellipsoidal approximations around the analytic center
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Proximal interior point approach in convex programming (ill-posed problems)*†
- The role of linear objective functions in barrier methods
Cited in
(38)- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- A homotopy method based on penalty function for nonlinear semidefinite programming
- An iterative method using boundary distance for box-constrained nonlinear semidefinite programs
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- An interior-point based subgradient method for nondifferentiable convex optimization
- On two interior-point mappings for nonlinear semidefinite complementarity problems
- A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
- Influence of initial solutions and step-lengths in the resolution of some classes of semidefinite programming problems with a predictor-corrector variant that uses the HKM direction
- Noninterior continuation method for solving semidefinite programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A filter-type method for solving nonlinear semidefinite programming
- An interior-point method for approximate positive semidefinite completions
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- A homotopy method for nonlinear semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A projected gradient method for optimization over density matrices
- Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- Successive linearization methods for nonlinear semidefinite programs
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system
- Priors with coupled first and second order differences for manifold-valued image processing
- Lower-order penalization approach to nonlinear semidefinite programming
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- On globally stable singular truss topologies
- A sequential quadratic penalty method for nonlinear semidefinite programming
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- A primal-dual interior point method for nonlinear semidefinite programming
This page was built for publication: An interior method for nonconvex semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863841)
