Penalty/Barrier Multiplier Methods for Convex Programming Problems
From MaRDI portal
Recommendations
Cited in
(57)- Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network
- Dual convergence for penalty algorithms in convex programming
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- An self-adaptive LQP method for constrained variational inequalities
- A barrier method in convex vector optimization with generalized inequality constraints
- Free material optimization via mathematical programming
- A class of nonlinear Lagrangians for nonconvex second order cone programming
- Blind source separation by sparse decomposition in a signal dictionary
- Unified theory of augmented Lagrangian methods for constrained global optimization
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions
- A primal-dual modified log-barrier method for inequality constrained nonlinear optimization
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Decomposition for structured convex programs with smooth multiplier methods
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- scientific article; zbMATH DE number 14495 (Why is no real title available?)
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- Constraint incorporation in optimization
- On barrier and modified barrier multigrid methods for three-dimensional topology optimization
- Robust solutions of uncertain linear programs
- Modified Lagrangian methods for separable optimization problems
- Minimization of the expected compliance as an alternative approach to multiload truss optimization
- Lagrangian penalization scheme with parallel forward-backward splitting
- Combined SVM-based feature selection and classification
- Some convex programs without a duality gap
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- Log-sigmoid multipliers method in constrained optimization
- Second-order multiplier iteration based on a class of nonlinear Lagrangians
- Combined SVM-based feature selection and classification
- A new nonlinear Lagrangian method for nonconvex semidefinite programming
- Primal–dual exterior point method for convex optimization
- Penalty and barrier methods for convex semidefinite programming
- Augmented Lagrangian method for solving convex quadratic fuzzy programming problem
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- The control of drilling vibrations: a coupled PDE-ODE modeling approach
- Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method
- Space-decomposition multiplier method for constrained minimization problems
- The Legendre transformation in modern optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Existence of local saddle points for a new augmented Lagrangian function
- A new family of penalties for augmented Lagrangian methods
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- Review of formulations for structural and mechanical system optimization
- Global asymptotic stabilisation of rational dynamical systems based on solving BMI
- Mechanical design problems with unilateral contact
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Penalty and Barrier Methods: A Unified Framework
- A note on the method of multipliers
- On using exterior penalty approaches for solving linear programming problems
- Exact augmented Lagrangian duality for mixed integer linear programming
- Decomposition methods based on augmented Lagrangians: a survey
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- A variance-expected compliance model for structural optimization
- Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain
This page was built for publication: Penalty/Barrier Multiplier Methods for Convex Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340799)
