A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation...
Saved in:
| Main Authors: | Mio Horai, Hideo Kobayashi, Takashi G. Nitta |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2016/1304954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Chirp Signal Transform and Its Properties
by: Mio Horai, et al.
Published: (2014-01-01) -
Relaxed Extragradient Algorithms for the Split Feasibility Problem
by: Youli Yu, et al.
Published: (2014-01-01) -
Improving Quantum Optimization Algorithms by Constraint Relaxation
by: Tomasz Pecyna, et al.
Published: (2024-09-01) -
Global Optimality Conditions for Nonlinear Programming Problems with Linear Equality Constraints
by: Guoquan Li, et al.
Published: (2014-01-01) -
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem
by: Xiaochun Li, et al.
Published: (2022-01-01)