scientific article; zbMATH DE number 1534290
From MaRDI portal
Publication:4517099
Cited in
(18)- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- Multiobjective duality for convex semidefinite programming problems
- A sensitivity result for semidefinite programs.
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Semidefinite programming via image space analysis
- A framework for solving mixed-integer semidefinite programs
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- Image space analysis for vector variational inequalities with matrix inequality constraints and applications
- A study of convex convex-composite functions via infimal convolution with applications
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Computing the distance between the linear matrix pencil and the completely positive cone
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- Statistical inference of semidefinite programming with multiple parameters
- Kurdyka-Łojasiewicz exponent via inf-projection
- Nonlinear separation methods and applications for vector equilibrium problems using improvement sets
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- An interior point-proximal method of multipliers for linear positive semi-definite programming
- Strong duality and minimal representations for cone optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517099)
