Nondifferentiable optimization and polynomial problems
From MaRDI portal
Cited in
(85)- Empirical risk minimization and problems of constructing linear classifiers
- On the lower bound for a quadratic problem on the Stiefel manifold
- The radar method: An effective line search for piecewise linear concave functions
- A robust algorithm for quadratic optimization under quadratic constraints
- Strong duality for general quadratic programs with quadratic equality constraints
- On global optimizations with polynomials
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Functionally redundant constraints for Boolean quadratic-type optimization problems
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Laplacian eigenvalues and fixed size multisection
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- scientific article; zbMATH DE number 3890233 (Why is no real title available?)
- On the iterative criterion for strong \(\mathcal{H}\)-tensors
- On solvability recognition for interval linear systems of equations
- Continuous optimization problems and a polynomial hierarchy of real functions
- Variable programming: a generalized minimax problem. I: Models and theory
- Parameter optimization problems for multilayer optical coatings
- A survey of hidden convex optimization
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Theory and software implementations of Shor's \(r\)-algorithms
- Brauer-type eigenvalue inclusion sets of stochastic/irreducible tensors and positive definiteness of tensors
- Constrained polynomial optimization problems with noncommuting variables
- LP-oriented upper bounds for the weighted stability number of a graph
- Smaller SDP for SOS decomposition
- Globally optimal estimates for geometric reconstruction problems
- Arithmetic modeling of random processes and \(r\)-algorithms
- On N. Z. Shor's three scientific ideas
- On the accuracy of dual bounds for quadratic extremum problems
- Regularized Newton method for unconstrained convex optimization
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
- An approach to determining Shor's dual quadratic estimates
- Further results on Cauchy tensors and Hankel tensors
- A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Space tensor conic programming
- Submodular functions: from discrete to continuous domains
- New quadratic models for the maximum weighted cut problem
- On Lipschitz optimization based on gray-box piecewise linearization
- An approach to the solution of nonlinear unconstrained optimization problems
- On solving nonconvex optimization problems by reducing the duality gap
- Numerical multilinear algebra and its applications
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Extrema of a real polynomial
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Certain questions in solving block nonlinear optimization problems with coupling variables
- On the global minimum in a balanced circular packing problem
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Nonsmooth-optimization methods in problems of stochastic programming
- Maximum consistency method for data fitting under interval uncertainty
- The matrix pencil nearness problem in structural dynamic model updating
- Parameter selection and preconditioning for a graph form solver
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- Balance layout problem for 3D-objects: mathematical model and solution methods
- An even order symmetric \(B\) tensor is positive definite
- On \(q\)-normal operators and the quantum complex plane
- Exact penalty functions and convex extensions of functions in schemes of decomposition in variables
- New Brualdi-type eigenvalue inclusion sets for tensors
- Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines
- Models and information technologies for decision support during structural and technological changes
- Alternating direction method for bi-quadratic programming
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- scientific article; zbMATH DE number 4076974 (Why is no real title available?)
- Certifying the global optimality of quartic minimization over the sphere
- Discrete dynamical system approaches for Boolean polynomial optimization
- On the problem of packing spheres in a cube
- Unified representation of the classical ellipsoid method
- A penalty approach to linear programs with many two-sided constraints
- Machine learning algorithms of relaxation subgradient method with space extension
- A Derivation of Lovász' Theta via Augmented Lagrange Duality
- Minimax deviation strategies for machine learning and recognition with short learning samples
- Problems related to estimating the coefficients of exact penalty functions
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
- Essentials of numerical nonsmooth optimization
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems
- Algorithmization and optimization models of patient-centric rehabilitation programs
- Optimization problems for the maximum \(k\)-plex
- Further results on sum-of-squares tensors
- A subgradient method with constant step-size for \(\ell_1\)-composite optimization
- A spatial kernel approach for topology optimization
- Some criteria for identifying strong \(\mathcal{H}\)-tensors
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Essentials of numerical nonsmooth optimization
- Methods for justifying arithmetic hypotheses and computer algebra
- Finding Symmetry Groups of Some Quadratic Programming Problems
This page was built for publication: Nondifferentiable optimization and polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384595)
