Restricted simplicial decomposition for convex constrained problems
From MaRDI portal
Publication:2366609
DOI10.1007/BF01581238zbMath0801.90092MaRDI QIDQ2366609
Donald W. Hearn, José A. Ventura
Publication date: 30 August 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (11)
Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ An oracle-based framework for robust combinatorial optimization ⋮ D-optimal design of a monitoring network for parameter estimation of distributed systems ⋮ Conditional gradient algorithms for norm-regularized smooth convex optimization ⋮ An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Combination of trust region method and simplicial decomposition for convex constrained nonlinear optimization ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finiteness in restricted simplicial decomposition
- Restricted simplicial decomposition: Computation and extensions
- On the Goldstein-Levitin-Polyak gradient projection method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
This page was built for publication: Restricted simplicial decomposition for convex constrained problems