A feasible direction method for the semidefinite program with box constraints
From MaRDI portal
Recommendations
- An iterative method using boundary distance for box-constrained nonlinear semidefinite programs
- New semidefinite programming relaxations for box constrained quadratic program
- A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
- A numerical feasible interior point method for linear semidefinite programs
- scientific article; zbMATH DE number 5209784
Cites work
- scientific article; zbMATH DE number 1215255 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- A new trust region algorithm for bound constrained minimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Family of projected descent methods for optimization problems with simple bounds
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On filter-successive linearization methods for nonlinear semidefinite programming
- Optimization theory and methods. Nonlinear programming
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Recent advances in bound constrained optimization
Cited in
(7)- An iterative method using boundary distance for box-constrained nonlinear semidefinite programs
- A novel approach for solving semidefinite programs
- An approximation scheme for distributionally robust PDE-constrained optimization
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- On a box-constrained linear symmetric cone optimization problem
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Robust data-driven dynamic optimization using a set-based gradient estimator
This page was built for publication: A feasible direction method for the semidefinite program with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654206)
