Projected Newton Methods for Optimization Problems with Simple Constraints
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Efficient and modular algorithms in modeling finite inelastic deformations: objective integration, parameter identification and sub-stepping techniques
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- Convergent stepsizes for constrained optimization algorithms
- Enhanced methods for feasible directions for engineering design problems
- Finiteness in restricted simplicial decomposition
- A projected Newton method in a Cartesian product of balls
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Algorithms for bound constrained quadratic programming problems
- Implementing proximal point methods for linear programming
- Solving some optimal control problems using the barrier penalty function method
- Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems
- Dynamic programming method for constrained discrete-time optimal control
- Error bounds and convergence analysis of feasible descent methods: A general approach
- An active constraints Newton algorithm for the spatial price equilibrium problem
- Interior point methods for optimal control of discrete time systems
- Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
- A note on exploiting structure when using slack variables
- Family of projected descent methods for optimization problems with simple bounds
- A survey of some mathematical programming models in transportation
- A unified approach for parameter identification of inelastic material models in the frame of the finite element method
- Parameter identification for finite deformation elasto-plasticity in principal directions
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- \(l_1\) regularized multiplicative iterative path algorithm for non-negative generalized linear models
- A closer look at consistent operator splitting and its extensions for topology optimization
- A variational formulation for fuzzy analysis in continuum mechanics
- Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- An efficient trust region method for unconstrained discrete-time optimal control problems
- Local convergence analysis of projection-type algorithms: unified approach
- A class of smoothing functions for nonlinear and mixed complementarity problems
- On the convergence of projected gradient processes to singular critical points
- An iterative working-set method for large-scale nonconvex quadratic programming
- Some recent advances in projection-type methods for variational inequalities
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- An active set feasible method for large-scale minimization problems with bound constraints
- NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods
- A sequential homotopy method for mathematical programming problems
- 2DNMR data inversion using locally adapted multi-penalty regularization
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- Sparse classification: a scalable discrete optimization perspective
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- An active set quasi-Newton method with projection step for monotone nonlinear equations
- LMBOPT: a limited memory method for bound-constrained optimization
- A novel projected gradient-like method for optimization problems with simple constraints
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- Scaled projected-directions methods with application to transmission tomography
- Convex optimization techniques in compliant assembly simulation
- Globally convergent DC trust-region methods
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- A polynomial chaos expanded hybrid fuzzy-stochastic model for transversely fiber reinforced plastics
- Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
- Consistent finite-dimensional approximation of phase-field models of fracture
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- A two-stage active-set algorithm for bound-constrained optimization
- Restricted simplicial decomposition for convex constrained problems
- The active-set method for nonnegative regularization of linear ill-posed problems
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Total variation-penalized Poisson likelihood estimation for ill-posed problems
- A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems
- Runge-Kutta-like scaling techniques for first-order methods in convex optimization
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- Global convergence of a modified gradient projection method for convex constrained problems
- Minimization of convex functions on the convex hull of a point set
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
- Semismooth Newton methods with a shooting-like technique for solving a constrained free-boundary HJB equation
- On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
- An automatic L₁-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks
- A finite element algorithm for parameter identification of material models for fluid-saturated porous media
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- Projection-free parallel quadratic programming for linear model predictive control
- A projected Newton algorithm for the dual convex program of elastoplasticity
- Parameter-identification of macroscopic material models based on virtual testing of given material mesostructures
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- On convergence of a receding horizon method for parabolic boundary control
- An active set truncated Newton method for large-scale bound constrained optimization
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- Heuristic discrepancy principle for variational regularization of inverse problems
- An equivalence between two algorithms for a class of quadratic programming problems withmmatrices*
- A differentiable exact penalty function for bound constrained quadratic programming problems
- An active set algorithm for nonlinear optimization with polyhedral constraints
This page was built for publication: Projected Newton Methods for Optimization Problems with Simple Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744873)
