The following pages link to (Q4324980):
Displaying 50 items.
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius (Q1765889) (← links)
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming (Q1769066) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- Graphical and numerical approach to robust stability analysis of fuzzy modeled systems with parametric uncertainty and disturbance (Q1770772) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- A unified class of directly solvable semidefinite programming problems (Q1772965) (← links)
- A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Log-barrier method for two-stage quadratic stochastic programming (Q1774842) (← links)
- Delay-dependent exponential stability analysis of bi-directional associative memory neural networks with time delay: an LMI approach (Q1777029) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
- Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers (Q1778137) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- Complexity bounds for primal-dual methods minimizing the model of objective function (Q1785201) (← links)
- On max-\(k\)-sums (Q1785208) (← links)
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) (← links)
- An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- On well definedness of the central path (Q1807813) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- Stability analysis of T-S fuzzy models for nonlinear multiple time-delay interconnected systems (Q1877722) (← links)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Self-scheduled \({\mathcal H}_ \infty\) control of linear parameter-varying systems: A design example (Q1899557) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- An algorithm for the quadratic stabilization of uncertain systems with structured uncertainty of the one-block type (Q1915797) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- On polynomiality of the method of analytic centers for fractional problems (Q1919100) (← links)
- A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190) (← links)
- An interior-point method for generalized linear-fractional programming (Q1922695) (← links)
- Performance analysis and controller synthesis for nonlinear systems with stochastic uncertainty constraints (Q1923013) (← links)
- Explicit controller formulas for LMI-based \(H_ \infty\) synthesis (Q1923020) (← links)
- Low-order control design for LMI problems using alternating projection methods (Q1923044) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- Approximate values for mathematical programs with variational inequality constraints (Q1928743) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- Noncommutative rational functions, their difference-differential calculus and realizations (Q1937788) (← links)
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming (Q1938082) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
