Solving semidefinite quadratic problems within nonsmooth optimization algorithms
From MaRDI portal
Publication:2564758
DOI10.1016/0305-0548(96)00006-8zbMath0871.90059OpenAlexW2050907032WikidataQ118165530 ScholiaQ118165530MaRDI QIDQ2564758
Publication date: 15 January 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(96)00006-8
nondifferentiable optimizationactive-set methodLagrangean dualslarge-scale integer linear programssemidefinite quadratic programming subproblem
Related Items
Tuning strategy for the proximity parameter in convex minimization, Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization, Lagrangian relaxation for SVM feature selection, A bundle-type algorithm for routing in telecommunication data networks, The proximal Chebychev center cutting plane algorithm for convex additive functions, A stabilized structured Dantzig-Wolfe decomposition method, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Incremental Bundle Methods using Upper Models, An approach to robust network design in telecommunications, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, An augmented subgradient method for minimizing nonsmooth DC functions, Discrete gradient method: Derivative-free method for nonsmooth optimization, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, An illumination problem: optimal apex and optimal orientation for a cone of light, Computing proximal points of nonconvex functions, A bundle-filter method for nonsmooth convex constrained optimization, An exact method with variable fixing for solving the generalized assignment problem, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, Codifferential method for minimizing nonsmooth DC functions, Room allocation: a polynomial subcase of the quadratic assignment problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Essentials of numerical nonsmooth optimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, An inexact bundle variant suited to column generation, On the choice of explicit stabilizing terms in column generation, A splitting bundle approach for non-smooth non-convex minimization, New approaches for optimizing over the semimetric polytope, Essentials of numerical nonsmooth optimization, About Lagrangian methods in integer optimization
Uses Software
Cites Work
- A combined transportation and scheduling problem
- A Cholesky dual method for proximal piecewise linear programming
- Lower bounds for the quadratic semi-assignment problem
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- SOLVING THE INVERSE PROBLEM FOR FUNCTION/IMAGE APPROXIMATION USING ITERATED FUNCTION SYSTEMS II: ALGORITHM AND COMPUTATIONS
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
