On the Resolution of Linearly Constrained Convex Minimization Problems

DOI10.1137/0804018zbMath0820.90084OpenAlexW1967367216MaRDI QIDQ4302315

Ana Friedlander, Sandra Augusta Santos, José Mario Martínez

Publication date: 14 August 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804018

zbMATH Keywords

optimality conditionsbox-constrained problemslarge-scale linearly constrained optimizationtwice differentiable convex function

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

On the regularization of mixed complementarity problems, An unconstrained optimization technique for large-scale linearly constrained convex minimization problems, Solution of linear complementarity problems using minimization with simple bounds, A trust region method for minimization of nonsmooth functions with linear constraints, PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, A new strategy for solving variational inequalities in bounded polytopes^∗, Parallel algorithms for large-scale linearly constrained minimization problem, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗, A minimax method with application to the initial vector coding problem^*, On the solution of bounded and unbounded mixed complementarity problems, On the solution of the extended linear complementarity problem, On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem, Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization, A new technique for inconsistent QP problems in the SQP method