The following pages link to (Q4517099):
Displaying 18 items.
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
- Image space analysis for vector variational inequalities with matrix inequality constraints and applications (Q983716) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A sensitivity result for semidefinite programs. (Q1417590) (← links)
- Multiobjective duality for convex semidefinite programming problems (Q1431149) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- Statistical inference of semidefinite programming with multiple parameters (Q2190284) (← links)
- Semidefinite programming via image space analysis (Q2358284) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- A primal-dual interior point trust-region method for nonlinear semidefinite programming (Q4999340) (← links)
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming (Q5058410) (← links)
- Nonlinear separation methods and applications for vector equilibrium problems using improvement sets (Q5164911) (← links)
- Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
