scientific article; zbMATH DE number 729680
From MaRDI portal
Publication:4324980
Recommendations
Cited in
(only showing first 100 items - show all)- Semidefinite descriptions of cones defining spectral mask constraints
- On the properties of convex functions over open sets
- Characterization of the barrier parameter of homogeneous convex cones
- Finite-sample analysis of \(M\)-estimators using self-concordance
- Realizations of non-commutative rational functions around a matrix centre. I: synthesis, minimal realizations and evaluation on stably finite algebras
- Super-Universal Regularized Newton Method
- Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs
- A complete algebraic solvability test for the nonstrict Lyapunov inequality
- Subgradient methods for huge-scale optimization problems
- Analysis and design of optimization algorithms via integral quadratic constraints
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Lifting for simplicity: concise descriptions of convex sets
- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- \(H_{2}\) guaranteed cost fuzzy control for uncertain nonlinear systems via linear matrix inequalities
- Chance constrained uncertain classification via robust optimization
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- Semi-definite programming and quantum information
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Cuts for mixed 0-1 conic programming
- LFTB: an efficient algorithm to bound linear fractional transformations
- Antenna array synthesis with clusters of unmanned aerial vehicles
- Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
- Computation of weighted sums of rewards for concurrent MDPs
- On zero duality gap in nonconvex quadratic programming problems
- Mathematical programming models and exact algorithms
- A relaxed logarithmic barrier method for semidefinite programming
- A primal-dual predictor-corrector interior point method for non-smooth contact dynamics
- Affine scaling algorithm fails for semidefinite programming
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- On reduction of duality gap in quadratic knapsack problems
- Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
- Positive semidefinite quadratic forms on unitary matrices
- Semi-definite relaxation algorithm of multiple knapsack problem
- Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions
- Point-sampled-data passivity stabilization of stochastic complex-valued memristor networks with multi-delays and reaction-diffusion term: a switching model approach
- Swarm formation for perimeter surveillance in rectangular strips: a distributed model predictive approach
- Generalized self-concordant functions: a recipe for Newton-type methods
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Least-squares orthogonalization using semidefinite programming
- Solving limit analysis problems: an interior-point method
- Ellipsoidal bounds for uncertain linear equations and dynamical systems
- A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone
- Learning semidefinite regularizers
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Livsic-type determinantal representations and hyperbolicity
- Speed scaling on parallel processors with migration
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Mars entry guidance based on nonlinear model predictive control with disturbance observer
- Dual optimal design and the Christoffel-Darboux polynomial
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
- Hyperbolic efficiency measurement: a conic programming approach
- Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Sparse Approximate Solutions to Semidefinite Programs
- Piecewise linear methods for nonlinear equations and optimization
- Semidefinite programming
- Scaling, shifting and weighting in interior-point methods
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- The complexity of some graph problems with bounded minors of their constraint matrices
- Performance analysis and controller synthesis for nonlinear systems with stochastic uncertainty constraints
- FANOK: knockoffs in linear time
- New dilated LMI characterization for the multiobjective full-order dynamic output feedback synthesis problem
- Non-asymptotic oracle inequalities for the Lasso and group Lasso in high dimensional logistic model
- Robust constrained model predictive control using linear matrix inequalities
- Cubic regularization of Newton method and its global performance
- A continuation method for (strongly) monotone variational inequalities
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- Optimal scaling of a gradient method for distributed resource allocation
- Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems.
- Extended formulations for order polytopes through network flows
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Robust port-Hamiltonian representations of passive systems
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- Mesh adaptive computation of upper and lower bounds in limit analysis
- Pseudo-Boolean optimization
- An interior point-proximal method of multipliers for linear positive semi-definite programming
- Interior-point methods for convex programming
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Computation of channel capacity based on self-concordant functions
- Strict anisotropic norm bounded real lemma in terms of matrix inequalities
- Scaling symmetric positive definite matrices to prescribed row sums.
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- scientific article; zbMATH DE number 7317464 (Why is no real title available?)
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
- On self-concordant barriers for generalized power cones
- Tight bounds for a class of data-driven distributionally robust risk measures
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- Online chasing problems for regular polygons
- Efficient algorithms for solving the p-Laplacian in polynomial time
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- Scalable Frank-Wolfe on generalized self-concordant functions via simple steps
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Image space analysis for vector variational inequalities with matrix inequality constraints and applications
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
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 Q4324980)
