scientific article; zbMATH DE number 3516928
From MaRDI portal
Publication:4097094
Recommendations
- scientific article; zbMATH DE number 3922389
- scientific article; zbMATH DE number 3508265
- The method of projection of the gradient in problems of infinite-dimensional optimization
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- scientific article; zbMATH DE number 3850830
Cited in
(48)- A relaxed version of Karmarkar's method
- A new linear programming algorithm - better or worse than the simplex method?
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
- Methods of centers for variational inequalities and linear programming
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- Algorithms for approximate calculation of the minimum of a convex function from its values
- Set variational inequalities
- State estimation in continuous dynamic systems by the ellipsoid method
- The generalized ellipsoid method
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Classical complexity and quantum entanglement
- A modification of the inscribed ellipsoid method
- State estimation by the ellipsoid method from continuous-time linear observations
- Complexity estimates of some cutting plane methods based on the analytic barrier
- A look at the past and present of optimization - an editorial
- Approximating the volume of convex bodies
- Fast search local extremum for maximal information coefficient (MIC)
- On the complexity of quasiconvex integer minimization problem
- Comparison of bundle and classical column generation
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- Numerical methods for the resource allocation problem in a computer network
- On the Turing model complexity of interior point methods for semidefinite programming
- On convex optimization problems in quantum information theory
- Excess information in parametric linear optimization
- Solving linear programming with constraints unknown
- Variable metric relaxation methods, part II: The ellipsoid method
- scientific article; zbMATH DE number 3922389 (Why is no real title available?)
- The information approach to multiextremal optimization problems
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
- Modifications and implementation of the ellipsoid algorithm for linear programming
- scientific article; zbMATH DE number 3508265 (Why is no real title available?)
- A new approach to the investigation of evolution differential equations in Banach spaces
- On the computational complexity of membership problems for the completely positive cone and its dual
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- The exact information-based complexity of smooth convex minimization
- Computing the value of information of quadratic decision problems and its non-negativity conditions
- One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
- An information complexity approach to extended formulations
- Subgradient ellipsoid method for nonsmooth convex problems
- Unified representation of the classical ellipsoid method
- A simple method for convex optimization in the oracle model
- On semidefinite programming characterizations of the numerical radius and its dual norm
- Undecidability and incompleteness in quantum information theory and operator algebras
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- An efficient solution to the informed principal problem
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 Q4097094)
