The following pages link to (Q4324980):
Displaying 50 items.
- A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance (Q423882) (← links)
- Robust portfolio selection involving options under a ``marginal+joint'' ellipsoidal uncertainty set (Q425328) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Linear computational complexity robust ILC for lifted systems (Q445135) (← links)
- Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization (Q445496) (← links)
- Design and optimization of buck and double buck converters by means of geometric programming (Q449667) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- Maximum divert for planetary landing using convex optimization (Q463013) (← links)
- Control: a perspective (Q463779) (← links)
- Lossless convexification of non-convex optimal control problems for state constrained linear systems (Q466469) (← links)
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- Calibration, sharpness and the weighting of experts in a linear opinion pool (Q492818) (← links)
- \( H_\infty\) control for networked systems with multiple packet dropouts (Q497657) (← links)
- Curvature of Hessian manifolds (Q499506) (← links)
- Relative entropy optimization and its applications (Q507310) (← links)
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Weak infeasibility in second order cone programming (Q518144) (← links)
- Networked control design for coalitional schemes using game-theoretic methods (Q518344) (← links)
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- Derivative of an integral over a convex polytope (Q533462) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities (Q550103) (← links)
- Robust \(\mathcal S\)-regularity of matrix pencils applied to the analysis of descriptor models (Q551240) (← links)
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise (Q554481) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- Local convergence of Newton's method under majorant condition (Q609243) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- New dilated LMI characterization for the multiobjective full-order dynamic output feedback synthesis problem (Q623642) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- Local convergence analysis of inexact Newton-like methods under majorant condition (Q626659) (← links)
- Lossless convexification of a class of optimal control problems with non-convex control constraints (Q627079) (← links)
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming (Q629098) (← links)
- Surface fitting and registration of point clouds using approximations of the unsigned distance function (Q631004) (← links)
- Robust univariate spline models for interpolating interval data (Q631219) (← links)
