Nondifferentiable optimization and polynomial problems

zbMATH Open0901.49015MaRDI QIDQ1384595FDOQ1384595

Authors: N. Z. Shor 

Publication date: 19 April 1998

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3890233
• scientific article; zbMATH DE number 1225243
• scientific article; zbMATH DE number 3894826
• scientific article; zbMATH DE number 4080780

zbMATH Keywords

computational complexitynonsmooth optimizationnondifferentiable optimizationHilbert's 17th problemglobal minimizationextremal graph problemsalgorithms of subgradientpolynomial extremal problemsspace dilatation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonsmooth analysis (49J52) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Cited In (85)

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

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)