Improved constraint consensus methods for seeking feasibility in nonlinear programs
From MaRDI portal
Recommendations
- The constraint consensus method for finding approximately feasible points in nonlinear programs
- Improving solver success in reaching feasibility for sets of nonlinear constraints
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
- Constraint consensus methods for finding interior feasible points in second-order cones
Cites work
- A Modeling Language for Mathematical Programming
- An iterative procedure for the solution of constrained nonlinear equations with application to optimization problems
- Benchmarking global optimization and constraint satisfaction codes
- Benchmarking optimization software with performance profiles.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Cyclic subgradient projections
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Historical Development of the Newton–Raphson Method
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Improving solver success in reaching feasibility for sets of nonlinear constraints
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
- The constraint consensus method for finding approximately feasible points in nonlinear programs
- The method of projections for finding the common point of convex sets
Cited in
(8)- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
- Implicit constraints handling for efficient search of feasible solutions
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Improving solver success in reaching feasibility for sets of nonlinear constraints
- The constraint consensus method for finding approximately feasible points in nonlinear programs
- scientific article; zbMATH DE number 3965830 (Why is no real title available?)
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
- Global optimization of mixed-integer nonlinear programs with SCIP 8
This page was built for publication: Improved constraint consensus methods for seeking feasibility in nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377177)
