Pages that link to "Item:Q2890424"
From MaRDI portal
The following pages link to The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs (Q2890424):
Displayed 16 items.
- Differential evolution with multi-constraint consensus methods for constrained optimization (Q377757) (← links)
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities (Q1659091) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators (Q2015484) (← links)
- Constraint consensus based artificial bee colony algorithm for constrained optimization problems (Q2296536) (← links)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
- Inertial accelerated algorithms for solving a split feasibility problem (Q2397577) (← links)
- Multistart algorithms for seeking feasibility (Q2459378) (← links)
- Improving solver success in reaching feasibility for sets of nonlinear constraints (Q2459379) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings (Q2956390) (← links)
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes (Q4924119) (← links)
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem (Q5169443) (← links)