Pages that link to "Item:Q1856370"

The following pages link to Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions (Q1856370):

Displaying 49 items.

• Imposing maximum length scale in topology optimization (Q381250) (← links)
• A trust-region framework for constrained optimization using reduced order modeling (Q400063) (← links)
• Handling infeasibility in a large-scale nonlinear optimization algorithm (Q430999) (← links)
• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component (Q463348) (← links)
• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Effective reformulations of the truss topology design problem (Q833422) (← links)
• Interior-point algorithms, penalty methods and equilibrium problems (Q853552) (← links)
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
• A robust and informative method for solving large-scale power flow problems (Q887172) (← links)
• Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
• A filter interior-point algorithm with projected Hessian updating for nonlinear optimization (Q1032531) (← links)
• An interior-point algorithm for nonconvex nonlinear programming (Q1294828) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
• Design of maximum permeability material structures (Q2459292) (← links)
• Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production (Q2464195) (← links)
• Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A smoothing heuristic for a bilevel pricing problem (Q2503215) (← links)
• A line search SQP method without a penalty or a filter (Q2516801) (← links)
• From global to local convergence of interior methods for nonlinear optimization (Q2867424) (← links)
• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• A selective strategy for shakedown analysis of engineering structures (Q2952284) (← links)
• An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← 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)
• Assessing the potential of interior point barrier filter line search methods: nonmonotone<i>versus</i>monotone approach (Q3111135) (← links)
• Reducing dimensionality in topology optimization using adaptive design variable fields (Q3549873) (← links)
• Hybridizing the electromagnetism-like algorithm with descent search for solving engineering design problems (Q3643180) (← links)
• Some recent developments in nonlinear optimization algorithms (Q4452115) (← links)
• A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)
• Solving mathematical programs with complementarity constraints as nonlinear programs (Q4673321) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A central path interior point method for nonlinear programming and its local convergence (Q5028593) (← links)
• Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming (Q5357005) (← links)
• Optimization-based approach to path planning for closed chain robot systems (Q5403422) (← links)
• Global and local convergence of a filter line search method for nonlinear programming (Q5436909) (← links)
• Practical implementation of an interior point nonmonotone line search filter method (Q5459727) (← links)
• The penalty interior-point method fails to converge (Q5717542) (← links)
• Interior point methods for large-scale nonlinear programming (Q5717543) (← links)
• On the behaviour of constrained optimization methods when Lagrange multipliers do not exist (Q5746720) (← links)
• Sensitivity analysis and robust assignment of natural frequencies for vibrating systems using the receptance method (Q6538237) (← links)