A method for solving some optimization problems with bounds on variables

DOI10.1007/S12597-013-0163-0zbMath1332.90263OpenAlexW2063729230MaRDI QIDQ260512

Pritibhushan Sinha

Publication date: 21 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-013-0163-0

zbMATH Keywords

bounds on variablesquasi-convex objectivesolution method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56)

Uses Software

• Unnamed Item

Cites Work

• A bundle-filter method for nonsmooth convex constrained optimization
• A branch-and-bound algorithm for bound constrained optimization problems without derivatives
• A particle swarm pattern search method for bound constrained global optimization
• Quasi-Concave Programming
• From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
• On the Convergence of the Multidirectional Search Algorithm
• Pattern Search Algorithms for Bound Constrained Minimization
• Nonlinear Programming
• A Review of Quasi-Convex Functions

This page was built for publication: A method for solving some optimization problems with bounds on variables