A primal-dual interior point trust-region method for nonlinear semidefinite programming
From MaRDI portal
Recommendations
- A primal-dual interior point method for nonlinear semidefinite programming
- scientific article; zbMATH DE number 5630197
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
Cites work
- A filter algorithm for nonlinear semidefinite programming
- A filter method for nonlinear semidefinite programming with global convergence
- A Global Algorithm for Nonlinear Semidefinite Programming
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A homotopy method for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A successive SDP-NSDP approach to a robust optimization problem in finance
- A survey of numerical methods for nonlinear semidefinite programming
- A two-step primal-dual interior point method for nonlinear semidefinite programming problems and its superlinear convergence
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- An interior method for nonconvex semidefinite programs
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- Determinant Maximization with Linear Matrix Inequality Constraints
- Estimation of failure probability using semi-definite logit model
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 2068039 (Why is no real title available?)
- scientific article; zbMATH DE number 1534290 (Why is no real title available?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Lower-order penalization approach to nonlinear semidefinite programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- On filter-successive linearization methods for nonlinear semidefinite programming
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- PENNON: A code for convex nonlinear and semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- Robust Control via Sequential Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Solving nonconvex SDP problems of structural optimization with stability control
- Successive linearization methods for nonlinear semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Trust Region Methods
Cited in
(11)- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Differentiable merit function for shifted perturbed Karush-Kuhn-Tucker conditions of nonlinear semidefinite programming
- A trust region method for solving semidefinite programs
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- A two-step primal-dual interior point method for nonlinear semidefinite programming problems and its superlinear convergence
- Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
- A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
This page was built for publication: A primal-dual interior point trust-region method for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999340)
