A constrained optimization approach to solving certain systems of convex equations

DOI10.1016/J.EJOR.2005.10.041MaRDI QIDQ853007zbMATHOpenAlexFDO

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

zbMATH Keywords

nonlinear programmingconvex programmingnonlinear equationsconvex equations

Mathematics Subject Classification ID

Convex programming (90C25)

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

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 4082855 (Why is no real title available?)
• scientific article; zbMATH DE number 46010 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 3554413 (Why is no real title available?)
• scientific article; zbMATH DE number 1148205 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• A finite improvement algorithm for the linear complementarity problem
• A globally convergent Newton-GMRES subspace method for systems of nonlinear equations
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence Conditions for Nonlinear Programming Algorithms
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Global Convergence of Newton–Gauss–Seidel Methods
• Integrals which are convex functionals
• Newton's Method for B-Differentiable Equations
• Newton's method for linear complementarity problems
• Solving Nonlinear Equations with Newton's Method

Cited in

(13)

• A new solving procedure by m-M calculus for problems of constrained optimization
• Investigating an overdetermined system of linear equations by using convex functions
• Concave programming and numerical methods for searching for real solutions of nonlinear systems.
• scientific article; zbMATH DE number 3945896 (Why is no real title available?)
• Convex minimization with constraints of systems of variational inequalities, mixed equilibrium, variational inequality, and fixed point problems
• scientific article; zbMATH DE number 617966 (Why is no real title available?)
• Solving Convex Programs by Means of Ordinary Differential Equations
• scientific article; zbMATH DE number 2012167 (Why is no real title available?)
• A general method for solving constrained optimization problems
• scientific article; zbMATH DE number 7685236 (Why is no real title available?)
• scientific article; zbMATH DE number 3908176 (Why is no real title available?)
• A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN
• Sufficient conditions for a real-valued function to have a unique root or no root at all

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)