Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
From MaRDI portal
Publication:280969
DOI10.1007/S10898-014-0244-5zbMATH Open1369.90133arXiv1308.4732OpenAlexW1989192034MaRDI QIDQ280969FDOQ280969
Publication date: 10 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based on the canonical duality-triality theory, this nonconvex problem is transformed to an equivalent dual problem, which can be solved easily under certain conditions. We proved that both global minimizer and the biggest local extrema of the primal problem can be obtained analytically from the canonical dual solutions. As two special cases, a quartic polynomial minimization and a minimax problem are discussed. Existence conditions are derived, which can be used to classify easy and relative hard instances. Applications are illustrated by several nonconvex and nonsmooth examples.
Full work available at URL: https://arxiv.org/abs/1308.4732
Recommendations
- Canonical duality theory and triality for solving general global optimization problems in complex systems
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- On d.c. optimization problems
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
- Complete solutions and extremality criteria to polynomial optimization problems
global optimizationminimax problemscanonical duality theorydouble-well functionlog-sum-exp functionpolynomial minimisation
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Optimization. Algorithms and consistent approximations
- Duality principles in nonconvex systems. Theory, methods and applications
- Methods of descent for nondifferentiable optimization
- Finite deformation beam models and triality theory in dynamical post-buckling analysis
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- A tutorial on geometric programming
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Minimax approach to structural optimization problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- On the triality theory for a quartic polynomial optimization problem
- Complete solutions and extremality criteria to polynomial optimization problems
- Pentavalent symmetric graphs of order twice a prime power
- Canonical Dual Solutions for Fixed Cost Quadratic Programs
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- On solving large-scale finite minimax problems using exponential smoothing
- Geometric Programming for Communication Systems
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Algorithms with adaptive smoothing for finite minimax problems
- Canonical dual approach to solving the maximum cut problem
- Solutions to quadratic minimization problems with box and integer constraints
- Canonical dual approach to solving 0-1 quadratic programming problems
Cited In (4)
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems
- On unconstrained optimization problems solved using the canonical duality and triality theories
This page was built for publication: Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280969)
