The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
From MaRDI portal
Publication:2890424
DOI10.1287/ijoc.1030.0046zbMath1239.90096OpenAlexW2121094316MaRDI QIDQ2890424
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0046
Related Items (16)
Improved constraint consensus methods for seeking feasibility in nonlinear programs ⋮ Constraint consensus methods for finding strictly feasible points of linear matrix inequalities ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ Differential evolution with multi-constraint consensus methods for constrained optimization ⋮ An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings ⋮ Constraint consensus methods for finding interior feasible points in second-order cones ⋮ Multistart algorithms for seeking feasibility ⋮ Improving solver success in reaching feasibility for sets of nonlinear constraints ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Non-monotonous sequential subgradient projection algorithm for convex feasibility problem ⋮ Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem ⋮ An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers ⋮ Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes ⋮ Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators ⋮ Constraint consensus based artificial bee colony algorithm for constrained optimization problems ⋮ Algorithms for the quasiconvex feasibility problem
Uses Software
This page was built for publication: The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
