Nondifferentiable optimization and polynomial problems

Publication date: 19 April 1998

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

zbMATH Keywords

computational complexity nonsmooth optimization nondifferentiable optimization Hilbert's 17th problem global minimization extremal graph problems algorithms of subgradient polynomial extremal problems space dilatation

Mathematics Subject Classification ID

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

Related Items

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