A linearized relaxing algorithm for the specific nonlinear optimization problem

DOI10.1155/2016/1304954zbMath1470.90090OpenAlexW2414488954WikidataQ59121497 ScholiaQ59121497MaRDI QIDQ1669202

Mio Horai, Hideo Kobayashi, Takashi Gyoshin Nitta

Publication date: 30 August 2018

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/1304954

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)

Cites Work

• Global optimization algorithm for sum of generalized polynomial ratios problem
• Transversality conditions for infinite horizon optimality: higher order differential problems
• Optimal solutions to the infinite horizon problems: constructing the optimum as the limit of the solutions for the finite horizon problems
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• A review of recent advances in global optimization
• A deterministic global optimization algorithm
• A note on a deterministic global optimization algorithm
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• A unified monotonic approach to generalized linear fractional programming
• Global optimization for the sum of certain nonlinear functions
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• Global optimization for the sum of generalized polynomial fractional functions
• Limit of the solutions for the finite horizon problems as the optimal solution to the infinite horizon optimization problems
• Nonconvex Optimization for Communication Networks
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

This page was built for publication: A linearized relaxing algorithm for the specific nonlinear optimization problem