Pages that link to "Item:Q1294828"

The following pages link to An interior-point algorithm for nonconvex nonlinear programming (Q1294828):

Displaying 50 items.

• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• Interior-point methods for the phase-field approach to brittle and ductile fracture (Q2022059) (← links)
• Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
• A Riemannian Newton trust-region method for fitting Gaussian mixture models (Q2066749) (← links)
• Designing polymer spin packs by tailored shape optimization techniques (Q2071423) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• Learning to steer nonlinear interior-point methods (Q2175369) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)
• Optimization techniques for tree-structured nonlinear problems (Q2221477) (← links)
• A Chebyshev technique for the solution of optimal control problems with nonlinear programming methods (Q2228757) (← links)
• An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
• Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
• A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors (Q2254755) (← links)
• A radial boundary intersection aided interior point method for multi-objective optimization (Q2282318) (← links)
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
• Fast projected gradient method for support vector machines (Q2358069) (← links)
• A modified differential evolution based solution technique for economic dispatch problems (Q2358897) (← links)
• Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
• Application of lower bound direct method to engineering structures (Q2385504) (← links)
• A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
• A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
• Steplength selection in interior-point methods for quadratic programming (Q2455431) (← links)
• Some iterative methods for the solution of a symmetric indefinite KKT system (Q2457945) (← links)
• An SQP-type algorithm for nonlinear second-order cone programs (Q2458912) (← links)
• An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
• An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A primal-dual interior-point algorithm for nonlinear least squares constrained problems (Q2568604) (← links)
• Globally convergent interior-point algorithm for nonlinear programming (Q2569192) (← links)
• Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions (Q2569198) (← links)
• An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems (Q2572712) (← links)
• Inner solvers for interior point methods for large scale nonlinear programming (Q2642630) (← links)
• From global to local convergence of interior methods for nonlinear optimization (Q2867424) (← links)
• A new framework for the computation of Hessians (Q2885473) (← links)
• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• An interior-point algorithm for solving inverse linear optimization problem (Q2903128) (← links)
• An interior point method for nonlinear programming with infeasibility detection capabilities (Q2926056) (← links)
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
• Solving discretized degenerate optimal control problems with state constraints (Q3057002) (← links)
• (Q3057247) (← links)
• Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods (Q3089761) (← links)
• Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
• Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
• The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning (Q3177159) (← links)
• Solving linear optimal control problems of the time-delayed systems by Adomian decomposition method (Q3389586) (← links)