The constraint consensus method for finding approximately feasible points in nonlinear programs

DOI10.1287/IJOC.1030.0046MaRDI QIDQ2890424zbMATH OpenOpenAlexFDO

Authors John W. Chinneck

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

zbMATH Keywords

approximate algorithmsfeasibilitynonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• Improved constraint consensus methods for seeking feasibility in nonlinear programs
• Methods for finding feasible points in constrained optimization
• Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• Constraint consensus methods for finding interior feasible points in second-order cones

Cited in

(19)

• Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
• An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
• Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
• Constraint consensus based artificial bee colony algorithm for constrained optimization problems
• Improved constraint consensus methods for seeking feasibility in nonlinear programs
• Inertial accelerated algorithms for solving a split feasibility problem
• Multistart algorithms for seeking feasibility
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• Algorithms for the quasiconvex feasibility problem
• An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings
• scientific article; zbMATH DE number 3965830 (Why is no real title available?)
• Differential evolution with multi-constraint consensus methods for constrained optimization
• Methods for finding feasible points in constrained optimization
• Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• Constraint consensus methods for finding interior feasible points in second-order cones
• Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery

Describes a project that uses

Uses Software

• MProbe

This page was built for publication: The constraint consensus method for finding approximately feasible points in nonlinear programs

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