A constrained optimization approach to solving certain systems of convex equations
From MaRDI portal
Publication:853007
DOI10.1016/J.EJOR.2005.10.041zbMATH Open1102.90042OpenAlexW1999694142MaRDI QIDQ853007FDOQ853007
Authors: Daniel Solow, Hantao Li 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.041
Recommendations
- A projection and contraction method for a system of nonlinear equations with convex constraints
- scientific article; zbMATH DE number 2128205
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- A superlinearly convergent hybrid algorithm for systems of nonlinear equations
- A superlinearly convergent projection method for constrained systems of nonlinear equations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integrals which are convex functionals
- Solving Nonlinear Equations with Newton's Method
- Newton's Method for B-Differentiable Equations
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- A globally convergent Newton-GMRES subspace method for systems of nonlinear equations
- Convergence Conditions for Nonlinear Programming Algorithms
- Newton's method for linear complementarity problems
- Title not available (Why is that?)
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
- Title not available (Why is that?)
- A finite improvement algorithm for the linear complementarity problem
- Title not available (Why is that?)
- Global Convergence of Newton–Gauss–Seidel Methods
Cited In (13)
- Solving Convex Programs by Means of Ordinary Differential Equations
- Title not available (Why is that?)
- Convex minimization with constraints of systems of variational inequalities, mixed equilibrium, variational inequality, and fixed point problems
- Title not available (Why is that?)
- Investigating an overdetermined system of linear equations by using convex functions
- Concave programming and numerical methods for searching for real solutions of nonlinear systems.
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN
- Title not available (Why is that?)
- A new solving procedure by m-M calculus for problems of constrained optimization
- Title not available (Why is that?)
- A general method for solving constrained optimization problems
- Sufficient conditions for a real-valued function to have a unique root or no root at all
- Title not available (Why is that?)
This page was built for publication: A constrained optimization approach to solving certain systems of convex equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853007)
