Projected Newton Methods for Optimization Problems with Simple Constraints
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Constrained numerical optimization methods for blind deconvolution
- Portfolio Optimization for Credit-Risky Assets under Marshall–Olkin Dependence
- Global convergence of a modified gradient projection method for convex constrained problems
- A quadratic penalty method for hypergraph matching
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Efficient and modular algorithms in modeling finite inelastic deformations: objective integration, parameter identification and sub-stepping techniques
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- A projected Newton method in a Cartesian product of balls
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Asymmetric linear double autoregression
- The method of successive affine reduction for nonlinear minimization
- A two-stage active-set algorithm for bound-constrained optimization
- Implementing proximal point methods for linear programming
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- Restricted simplicial decomposition for convex constrained problems
- On projected Newton-Krylov solvers for instationary laminar reacting gas flows
- An efficient trust region method for unconstrained discrete-time optimal control problems
- A finite element algorithm for parameter identification of material models for fluid-saturated porous media
- Convergence properties of nonmonotone spectral projected gradient methods
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- Total variation-penalized Poisson likelihood estimation for ill-posed problems
- Accelerating the convergence in the single-source and multi-source Weber problems
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- On large scale nonlinear network optimization
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- Heuristic discrepancy principle for variational regularization of inverse problems
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Sparse classification: a scalable discrete optimization perspective
- Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning
- An active-set projected trust region algorithm for box constrained optimization problems
- Convergence properties of trust region methods for linear and convex constraints
- A variational formulation for fuzzy analysis in continuum mechanics
- Quasi-Newton projection methods and the discrepancy principle in image restoration
- Efficient nonnegative matrix factorization via projected Newton method
- Convex optimization techniques in compliant assembly simulation
- Algorithms for bound constrained quadratic programming problems
- On the ensemble Kalman inversion under inequality constraints
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A sequential homotopy method for mathematical programming problems
- An ODE traffic network model
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A projected Newton-CG method for nonnegative astronomical image deblurring
- An active set feasible method for large-scale minimization problems with bound constraints
- Dynamic programming method for constrained discrete-time optimal control
- The relative formulation of the quadratic programming problem in the aircraft assembly modeling
- Linear programming with nonparametric penalty programs and iterated thresholding
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
- The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic
- An active set quasi-Newton method with projection step for monotone nonlinear equations
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- Global pricing and feasible directions in linear programming
- Complexity of a projected Newton-CG method for optimization with bounds
- Scaled projected-directions methods with application to transmission tomography
- 2DNMR data inversion using locally adapted multi-penalty regularization
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- Modular proximal optimization for multidimensional total-variation regularization
- A survey of some mathematical programming models in transportation
- A polynomial chaos expanded hybrid fuzzy-stochastic model for transversely fiber reinforced plastics
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- A solver for nonconvex bound-constrained quadratic optimization
- New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact
- An active set truncated Newton method for large-scale bound constrained optimization
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- A unified approach for parameter identification of inelastic material models in the frame of the finite element method
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Globally convergent DC trust-region methods
- Proximal methods for the latent group lasso penalty
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Structured sparsity: discrete and convex approaches
- Parameter-identification of macroscopic material models based on virtual testing of given material mesostructures
- Semismooth Newton methods with a shooting-like technique for solving a constrained free-boundary HJB equation
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- \(l_1\) regularized multiplicative iterative path algorithm for non-negative generalized linear models
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
- An active constraints Newton algorithm for the spatial price equilibrium problem
- Local convergence analysis of projection-type algorithms: unified approach
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- scientific article; zbMATH DE number 1487433 (Why is no real title available?)
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A stochastic gradient descent algorithm to maximize power utility of large credit portfolios under Marshall-Olkin dependence
- A symmetric rank-one quasi-Newton method for nonnegative matrix factorization
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)
