A new accelerating method for globally solving a class of nonconvex programming problems
From MaRDI portal
Publication:923946
DOI10.1016/J.NA.2009.01.142zbMATH Open1168.90576OpenAlexW2090518645MaRDI QIDQ923946FDOQ923946
Authors: Xiaodi Bai, Weimin Li, Peiping Shen 
Publication date: 24 July 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.01.142
Recommendations
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- An accelerating algorithm for globally solving nonconvex quadratic programming
- A new global optimization algorithm for solving a class of nonconvex programming problems
- A branch and bound algorithm for a class of non-convex programming problems
- scientific article; zbMATH DE number 5583854
Cites Work
- Robust Optimization of Large-Scale Systems
- Convex analysis and global optimization
- A new rectangle branch-and-pruning approach for generalized geometric programming
- Global optimization of multiplicative programs
- A unified monotonic approach to generalized linear fractional programming
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Prediction of oligopeptide conformations via deterministic global optimization
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A deterministic global optimization algorithm for generalized geometric programming
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Solving long-term financial planning problems via global optimization
- Title not available (Why is that?)
- Finite algorithm for generalized linear multiplicative programming
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- Title not available (Why is that?)
Cited In (13)
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- A deterministic method for solving the sum of linear ratios problem
- Global optimization algorithm for a generalized linear multiplicative programming
- A branch and bound algorithm for a class of non-convex programming problems
- A new global optimization algorithm for solving a class of nonconvex programming problems
- An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A global optimization algorithm for signomial geometric programming problem
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Title not available (Why is that?)
This page was built for publication: A new accelerating method for globally solving a class of nonconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923946)
