Solving nearly-separable quadratic optimization problems as nonsmooth equations
From MaRDI portal
(Redirected from Publication:2013144)
dual decompositionsemismooth Newton methodsFischer-Burmeister functioncomplementarity problemsquadratic optimization problems
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15) Decomposition methods (49M27) Numerical methods involving duality (49M29) Numerical methods based on necessary conditions (49M05)
Recommendations
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Nonsmooth optimization via quasi-Newton methods
- Quadratic Approximations in Convex Nondifferentiable Optimization
- Quasi-Newton methods for solving nonlinear programming problems
- Separable standard quadratic optimization problems
- A solver for nonconvex bound-constrained quadratic optimization
- Algebraic solution of the problems of nonconvex quadratic programming
- On solvability of convex noncoercive quadratic programming problems
- Numerical solution of special problems of nonconvex quadratic programming
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2068037 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A line search filter approach for the system of nonlinear equations
- A nonsmooth version of Newton's method
- A parallel quadratic programming method for dynamic optimization problems
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Convex optimization theory.
- Directional derivatives of the solution of a parametric nonlinear program
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global optimization of nonlinear network design
- Interior-point Lagrangian decomposition method for separable convex optimization
- Introduction to Stochastic Programming
- Introductory lectures on convex optimization. A basic course.
- Iteration complexity analysis of dual first-order methods for conic convex programming
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Microeconomic theory
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear programming without a penalty function.
- On the Global Convergence of a Filter--SQP Algorithm
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the optimal design of water distribution networks: a practical MINLP approach
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Path-following gradient-based decomposition algorithms for separable convex optimization
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Semismooth and Semiconvex Functions in Constrained Optimization
- Sensitivity analysis for nonlinear programming using penalty methods
- Smooth minimization of non-smooth functions
- The Linear Complementarity Problem
- The semismooth algorithm for large scale complementarity problems
Cited in
(2)
This page was built for publication: Solving nearly-separable quadratic optimization problems as nonsmooth equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013144)
