Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes

DOI10.1080/10556788.2011.647818zbMath1270.90077OpenAlexW2061369268MaRDI QIDQ4924119

Laurence Smith, Victor Aitken, John W. Chinneck

Publication date: 30 May 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.647818

zbMATH Keywords

clusteringconcentrationconstraint consensusnonlinear constrained global optimizationdisjoint feasible regions

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (1)

A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations

Uses Software

• KNITRO
• AMPL

Cites Work

• Unnamed Item
• The parallel genetic algorithm as function optimizer
• A starting point strategy for nonlinear interior methods.
• Multistart algorithms for seeking feasibility
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Constraint handling in genetic algorithms using a gradient-based repair method
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
• Methods for finding feasible points in constrained optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes