scientific article; zbMATH DE number 729680
From MaRDI portal
Publication:4324980
Recommendations
Cited in
(only showing first 100 items - show all)- Output feedback model predictive control of uncertain norm-bounded linear systems
- Approximate gcds of polynomials and sparse SOS relaxations
- A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- Characterizations of mixed binary convex quadratic representable sets
- Estimation of the Hurst parameter for fractional Brownian motion using the CMARS method
- Enumeration approach to computing chemical equilibria
- Domain adaptation and sample bias correction theory and algorithm for regression
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- H∞ control of discrete-time linear systems constrained in state by equality constraints
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
- Linear matrix inequalities in control systems with uncertainty
- Smoothed analysis of condition numbers and complexity implications for linear programming
- Dynamic balance of segregation distortion and selection maintains normal allele sizes at the myotonic dystrophy locus
- A subdivision method for computing nearest gcd with certification
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Convergence of entropic schemes for optimal transport and gradient flows
- Spectrahedral shadows
- Optimal experimental design and some related control problems
- Speed scaling for maximum lateness
- Fast MCMC sampling algorithms on polytopes
- Randomized block proximal damped Newton method for composite self-concordant minimization
- A self-concordant interior point approach for optimal control with state constraints
- A novel approach for solving semidefinite programs
- Linear matrix inequality representation of sets
- Interior-point methods
- New versions of Newton method: step-size choice, convergence domain and under-determined equations
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases
- Composite convex optimization with global and local inexact oracles
- Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture
- Two numerical methods for optimizing matrix stability
- On fair person classification based on efficient factor score estimates in the multidimensional factor analysis model
- The tropical analogue of the Helton-Nie conjecture is true
- Positive semidefinite relaxations for distance geometry problems.
- Hardness results for structured linear systems
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- scientific article; zbMATH DE number 6285133 (Why is no real title available?)
- An SQP method for general nonlinear complementarity problems
- Multirate multicast service provisioning. II: A tâtonnement process for rate allocation
- Barrier function based model predictive control
- Interior-point methods for nonlinear complementarity problems
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- A two-step improved Newton method to solve convex unconstrained optimization problems
- Dynamic state feedback controller and observer design for dynamic artificial neural network models
- On Newton's method for solving generalized equations
- Confidence structural robust optimization by non linear semidefinite programming-based single-level formulation
- An affine scaling method using a class of differential barrier functions: primal approach
- A Relaxation Approach to Feature Selection for Linear Mixed Effects Models
- Extending interior-point methods to nonlinear second-order cone programming: application to finite-strain elastoplasticity
- A framework for solving mixed-integer semidefinite programs
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- Real zeros of mixed random fewnomial systems
- The tracial moment problem and trace-optimization of polynomials
- Approximate minimum enclosing balls in high dimensions using core-sets
- Selfsimilar Hessian manifolds
- A class of robust bounded controllers tracking a nonlinear discrete-time stochastic system: attractive ellipsoid technique application
- Convex optimization with an interpolation-based projection and its application to deep learning
- Robust formulations for clustering-based large-scale classification
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- A game of international climate policy solved by a homogeneous oracle-based method for variational inequalities
- Towards a computationally tractable maximum entropy principle for nonstationary financial time series
- The maximum cut problem on blow-ups of multiprojective spaces
- Extremum-seeking control of state-constrained nonlinear systems
- Optimality criteria without constraint qualifications for linear semidefinite problems
- On duality gap in linear conic problems
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- A globally convergent filter-type trust region method for semidefinite programming
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Robust convex conic optimization in D-induced duality framework
- Randomized interior point methods for sampling and optimization
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Generalized Gauss inequalities via semidefinite programming
- Derivative of an integral over a convex polytope
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Interior point methods 25 years later
- Symbolic computation in hyperbolic programming
- Delay-dependent exponential stability analysis of bi-directional associative memory neural networks with time delay: an LMI approach
- An improved stability criterion for systems with distributed delays
- LASSO for streaming data with adaptative filtering
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- On box-constrained total least squares problem
- Distributed set-membership filtering for time-varying systems under constrained measurements and replay attacks
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets
- On the generalized essential matrix correction: an efficient solution to the problem and its applications
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Packing under convex quadratic constraints
- A finite steps algorithm for solving convex feasibility problems
- Universal Barrier Is n-Self-Concordant
- Robust stability and structured uncertainty bounded by the Euclidean norm
- Matrix convex hulls of free semialgebraic sets
- An augmented Lagrangian method for the optimal \(H_\infty\) model order reduction problem
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- An oracle based method to compute a coupled equilibrium in a model of international climate policy
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)
