The following pages link to (Q4324980):
Displaying 50 items.
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Chance constrained uncertain classification via robust optimization (Q633103) (← links)
- Barrier subgradient method (Q633113) (← links)
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
- Semidefinite representation of convex hulls of rational varieties (Q637512) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems (Q639203) (← links)
- A self-concordance property for nonconvex semidefinite programming (Q639360) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- Convex hulls of curves of genus one (Q645211) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases (Q672224) (← links)
- A complete algebraic solvability test for the nonstrict Lyapunov inequality (Q672437) (← links)
- Linear matrix inequalities in robustness analysis with multipliers (Q673057) (← links)
- Structurally balanced controller order reduction with guaranteed closed loop performance (Q674049) (← links)
- Robust constrained model predictive control using linear matrix inequalities (Q674928) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- On duality gap in linear conic problems (Q691369) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Unifying optimal partition approach to sensitivity analysis in conic optimization (Q702383) (← links)
- Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
- \(H_{2}\) guaranteed cost fuzzy control for uncertain nonlinear systems via linear matrix inequalities (Q703333) (← links)
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities (Q704756) (← links)
- Barrier function based model predictive control (Q705163) (← links)
- An LMI approach to asymptotical stability of multi-delayed neural networks (Q707178) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems (Q715082) (← links)
- T-S fuzzy model-based impulsive control of chaotic systems with exponential decay rate (Q715974) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Double delayed feedback control for the stabilization of unstable steady states in chaotic systems (Q717410) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems (Q725814) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
- Convexity of Gaussian chance constraints and of related probability maximization problems (Q736601) (← links)
- Estimating cell probabilities in contingency tables with constraints on marginals/conditionals by geometric programming with applications (Q736994) (← links)
- Efficient adaptive regression spline algorithms based on mapping approach with a case study on finance (Q740643) (← links)
- Space tensor conic programming (Q742309) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- Block splitting for distributed optimization (Q744220) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones (Q747766) (← links)
- Matrices with prescribed row and column sums (Q763065) (← links)
