A method for solving some optimization problems with bounds on variables

DOI10.1007/S12597-013-0163-0MaRDI QIDQ260512zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The bounded variable problem‐an application of the dual method for quadratic programming
• scientific article; zbMATH DE number 5000797
• scientific article; zbMATH DE number 1069803
• Publication:3479824
• scientific article; zbMATH DE number 4037612

Cites work

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

Cited in

(4)

• An Implementation of Variable Upper Bounds via SUB Methodology
• Reference variable methods of solving min-Max optimization problems
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• scientific article; zbMATH DE number 5000797 (Why is no real title available?)

Describes a project that uses

Uses Software

• PSwarm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260512)